Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem

Discrete Applied Mathematics

Volumn 98, Issue 3, 2000, Pages 209-217

  Kravchenko, Svetlana A ^a  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Job shop; NP hard problem; Pseudo polynomial algorithm

Indexed keywords

EID: 0037513522     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00165-1     Document Type: Article

References (13)

1. Brucker P. A linear time algorithm to minimize maximum lateness for the two-machine unit-time, job-shop, scheduling problem. Lecture Notes in Control and Inform. Sci. 38:1982;566-571.
2. Brucker P. Minimizing maximum lateness in a two-machine unit-time job-shop. Computing. 27:1981;367-370.
3. Gonzalez T., Sahni S. Flow shop and job shop schedules: complexity and approximation. Oper. Res. 26:1978;36-52.
4. Hefetz N., Adiri I. An efficient optimal algorithm for the two-machine, unit-time, job-shop, schedule-length problem. Math. Oper. Res. 7:1982;354-360.
5. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
6. S.A. Kravchenko, Optimal scheduling for two-machine unit-time job-shop problems, Preprint N 7, Institute of Engineering Cybernetics, Minsk, Belarus, 1995 (in Russian).
7. Kubiak W., Sethi S., Sriskandarajah C. An efficient algorithm for a job shop problem. Math. Indust. Systems. 1:1995;203-216.
8. Kubiak W., Timkovsky V.G. Total completion time minimization in two-machine job shop with unit-time operations. European J. Oper Res. 94:1996;310-320.
9. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling:algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistic of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445-522.
10. Lenstra J.K., Rinnooy Kan A.H.G. Computational complexity of discrete optimization problems. Ann. Discrete Math. 4:1979;121-140.
11. V.G. Timkovsky, Polynomial-time algorithm for Lenstra-Rinnooy Kan two-machine scheduling problem, Kibernetika 2 (1985) 109-111 (in Russian).
12. Timkovsky V.G. A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem. Discrete Appl. Math. 77:1997;185-200.
13. Timkovsky V.G. Is a unit-time job shop not easier than identical parallel machines. Discrete Appl. Math. 85:1998;149-162.