Makespan minimization in preemptive two machine job shops

Computing (Vienna/New York)

Volumn 60, Issue 1, 1998, Pages 73-79

  Sevastianov, S V ^a   Woeginger, G J ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Approximation algorithm; Job shop; Scheduling; Worst case analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

PREEMPTIVE TWO MACHINE JOB SHOP PROBLEM;

OPTIMIZATION;

EID: 0031649230     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684330     Document Type: Article

References (10)

1. Akers, S, B.: A graphical approach to production scheduling problems. Oper. Res. 4, 244-245 (1956).
2. Brucker, P., Kravchenko, S. A., Sotskov, Y. N.: Preemptive job-shop scheduling problems with a fixed number of jobs. Osnabrücker Schriften zur Mathematik, 184, Universität Osnabrück, Germany (1997).
3. Gonzalez, T., Sahni, S,: Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26, 36-52 (1978).
4. Graham, R. L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416-429 (1969).
5. Hall, L. A.: Approximability of flow shop scheduling. In: Proceedings of 36th IEEE Symposium on Foundations of Computer Science, pp. 82-91 (1995).
6. Hefetz, N., Adiri, I.: An efficient optimal algorithm for the two-machine, unit-time, jobshop, schedule-length problem. Math. Oper. Res. 7, 354-360 (1982).
7. Jackson, J. R.: An extension of Johnson's result on job lot scheduling. Naval. Res. Log. Q. 3, 201-203 (1956).
8. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science, Vol. 4, pp. 445-522. Amsterdam: North Holland, 1993.
9. Sevastianov, S. V., Woeginger, G. J.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program, to appear (1997).
10. Shmoys, D. B., Stein, C., Wein, J.: Improved approximation algorithm for shop scheduling problems. SIAM. J. Comput. 23, 617-632 (1996).