Search Results - subject:"Approximation scheme"

Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities

Chubanov, Sergei; Pesch, Erwin - In: Mathematical Methods of Operations Research 70 (2009) 2, pp. 313-335

We consider a production model with two facilities sharing a resource during a time horizon consisting of a number of time periods. Cumulative production levels at the ends of consecutive periods are linked with constraints of a general form. This allows us to give different interpretations...

Persistent link: https://www.econbiz.de/10010949919

A PTAS for minimizing the total weighted completion time on identical parallel machines

SKUTELLA, Martin; WOEGINGER, Gerhard J. - Center for Operations Research and Econometrics (CORE), … - 1999

paper is a polynomial time approximation scheme for this setting, which settles a problem that was open for a long time …. Moreover, our result constitutes the first known approximation scheme for a strongly NP-hard scheduling problem with minsum …

Persistent link: https://www.econbiz.de/10005043718

Approximating Multiobjective Knapsack Problems

Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich - In: Management Science 48 (2002) 12, pp. 1603-1612

-dimensional knapsack problem, a practical fully polynomial-time approximation scheme (FPTAS) is derived. It is based on a new approach to … length. For the multiobjective m-dimensional knapsack problem, the first known polynomial-time approximation scheme (PTAS …

Persistent link: https://www.econbiz.de/10009209075

Approximation Procedures for the One-Warehouse Multi-Retailer System

Lu, Lu; Posner, Marc E. - In: Management Science 40 (1994) 10, pp. 1305-1316

polities called stationary interval policies. For this class of policies, we develop a fully polynomial-time approximation … scheme where the relative error is within \varepsilon > 0, and the computational effort increases as a linear function of 1 …

Persistent link: https://www.econbiz.de/10009208773