A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem

Discrete Applied Mathematics

Volumn 77, Issue 2, 1997, Pages 185-200

  Timkovsky, Vadim G ^a  

^a Multipath Business Systems Inc   (Canada)

Author keywords

Due dates; Job shop scheduling; Maximum lateness; Polynomial time algorithm; Release dates; Schedule length; Unit time operations

Indexed keywords

EID: 0005847198     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00106-0     Document Type: Article

References (13)

1. P. Brucker, Minimizing maximum lateness in two-machine unit-time job-shop, Computing 27 (1981) 367-370.
2. P. Brucker A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem, Lecture Notes in Control Inform. Sci., Vol. 38 (1982) 566-571.
3. E.G. Coffman, Jr., ed., Computer and Job-shop Scheduling Theory (Wiley, New York, 1976).
4. M.R. Garey and D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).
5. N. Hefetz and I. Adiri, An efficient optimal algorithm for the two-machine, unit-time, job-shop, schedule-length, problem, Math. Oper. Res. 7 (1982) 354-360.
6. W. Kubiak, S. Sethi and C. Sriskandarajah, An efficient algorithm for a job shop problem, Math. Indust. Systems 1 (1995) 203-216.
7. W. Kubiak and V.G. Timkovsky, A polynomial-time algorithm for total completion time minimization in two-machine job shop with unit-time operations, European Journal of Operational Research 94 (1996) 310-320.
8. J.K. Lenstra and A.H.G. Rinnooy Kan, Computational complexity of discrete optimization problems, Ann. Discrete Math. 4 (1979) 121-140.
9. A.H.G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations (Nijhoff, The Hague, 1976).
10. V.G. Timkovsky, Polynomial-time algorithm for the Lenstra-Rinnooy Kan two-machine scheduling problem, Kibernetika (2) (1985) 109-111 (in Russian).
11. V.G. Timkovsky, On the complexity of scheduling an arbitrary system, Sov. J. Comput. System Sci. (5) (1985) 46-52
12. V.G. Timkovsky, The complexity of unit-time job-shop scheduling, Technical Report No. 93-09, Dept. Computer Sci. Systems, McMaster University, Hamilton (1993).
13. V.G. Timkovsky, Is the unit-time job-shop not easier than identical parallel machines?, submitted.