A polynomial approximation scheme for problem F2/rj/Cmax

Operations Research Letters

Volumn 20, Issue 2, 1997, Pages 75-79

  Kovalyov, Mikhail Y ^a   Werner, Frank ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Dynamic programming; Polynomial approximation scheme; Scheduling; Two machine flow shop

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; MACHINERY; SCHEDULING;

POLYNOMIAL APPROXIMATION SCHEME; TWO MACHINE FLOW SHOP;

APPROXIMATION THEORY;

EID: 0031078563     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(96)00049-1     Document Type: Article

References (13)

1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, 1979.
2. R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: a survey", Ann. Discrete Math. 5, 287-326 (1979).
3. L.A. Hall, "A polynomial approximation scheme for a constrained flow-shop scheduling problem", Math. Oper. Res. 19, 68-85 (1994).
4. L.A. Hall and D.B. Shmoys, "Approximation algorithms for constrained scheduling problems", Proc. IEEE 30th Ann. Symp. Foundations of Computer Science, 1989.
5. L.A. Hall and D.B. Shmoys, "Near-optimal sequencing with precedence constraints", Proc. Math. Prog. Soc. Conference on Integer Programming and Combinatorial Optimization, University of Waterloo, 1990.
6. L.A. Hall and D.B. Shmoys, "Jackson's rule for single-machine scheduling: making a good heuristic better", Math. Oper. Res. 17, 22-35 (1992).
7. S.M. Johnson, "Optimal two- and three-stage production scheduling with setup times included", Naval Res. Logist. Quart. 1, 61-68 (1954).
8. M.Y. Kovalyov, "Scheduling two-machine flow-shops in parallel", preprint 3, Institute of Engineering Cybernetics, Belarus Academy of Sciences, Minsk, 1993.
9. E.L. Lawler and J.M. Moore, "A functional equation and its application to resource allocation and sequencing problems", Management Sci. 16, 77-84 (1969).
10. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker, "Complexity of machine scheduling problems", Ann. Discrete Math. 1, 343-362 (1977).
11. C.N. Potts, "Analysis of heuristics for two-machine flow-shop sequencing subject to release dates", Math. Oper. Res. 10, 576-584 (1985).
12. M.H. Rothkopf, "Scheduling independent tasks on parallel processors", Management Sci. 12, 437-447 (1966).
13. S. Sahni, "General techniques for combinatorial approximation", Oper. Res. 25, 920-936 (1977).