Is a unit-time job shop not easier than identical parallel machines?

Discrete Applied Mathematics

Volumn 85, Issue 2, 1998, Pages 149-162

  Timkovsky, Vadim G ^a  

^a Star Data Systems Inc   (Canada)

Author keywords

Identical parallel machines; Job shop; NP hardness; Polynomial time reduction; Scheduling; Unit time operations

Indexed keywords

EID: 0004708371     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00032-8     Document Type: Article

References (38)

1. P. Brucker, A. Kraemer, Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, EJOR 90 (1996) 214-226.
2. P. Brucker, S.A. Kravchenko, Y.N. Sotskov, On the complexity of two machine job-shop scheduling with regular objective functions, OSM Reihe P, vol. 172, 1995.
3. J.L. Bruno, E.G. Coffman, Jr., R. Sethi, Scheduling independent tasks to reduce mean finishing time, Comm. ACM 17 (1974) 382-387.
4. R.W. Conway, W.L Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967.
5. J. Du, J.Y.-T. Leung, Minimizing total tardiness on one machine is NP-hard, Math. Oper. Res. 15 (1990) 483-495.
6. J. Du, J.Y.-T. Leung, C.S. Wong, Minimizing the number of late jobs with release time constraints, J. Combin. Math. Combin. Comput. 11 (1992) 97-107.
7. J. Du, J.Y.-T. Leung, G.H. Young, Minimizing mean flow time with release time constraints Theoret. Comput. Sci. 75 (1990) 347-355.
8. J. Du, J.Y.-T. Leung, G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time, Inform. Comput. 92 (1991) 219-236.
9. A. Federgruen, Groenevelt, Preemptive scheduling of uniform machines by ordinary network flow techniques, Management Sci. 32 (1986) 431-349.
10. M.R. Garey, D.S. Johnson, Strong NP-completeness results: motivation, examples and implications, J. ACM 25 (1978) 499-508.
11. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
12. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
13. 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.
14. S.A. Kravchenko, Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem. Discrete Appl. Math., submitted.
15. S.A. Kravchenko, A polynomial algorithm for a two-machine no-wait job-shop scheduling problem, EJOR, to appear.
16. W. Kubiak, A pseudopolynomial algorithm for a two-machine no-wait job shop problem, EJOR 43 (1989) 267-270.
17. W. Kubiak, S. Sethi, C. Sriskandarajah, An efficient algorithm for a job shop problem, Math. Ind. Systems 1 (1995) 203-216.
18. W. Kubiak, V.G. Timkovsky, A polynomial-time algorithm for total completion time minimization in two-machine job-shop with unit-time operations EJOR 94 (1996) 310-320.
19. J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization Academic Press, New York, 1984, pp. 245-261.
20. E.L. Lawler, A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness, Ann. Discrete Math. 1 (1977) 331-342.
21. E.L. Lawler, Preemptive scheduling of precedence-constrainted jobs on parallel machines, in: M.A.H. Dempster, J.K. Lenstra, A.H.G. Rinnooy Kan (Eds.), Deterministic and Stochastic Scheduling Reidel, Dordrecht, 1982, pp. 101-123.
22. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Recent developments in deterministic sequencing and scheduling: a survey, in: M.A.H. Dempster, J.K. Lenstra, A.H.G. Rinnooy Kan (Eds.), Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, pp. 35-73.
23. 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.), Handbook on Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory. Elsevier, Amsterdam, 1993, pp. 445-552.
24. J.K. Lenstra, Private communication
25. J.K. Lenstra, A.H.G. Rinnooy Kan, Computational complexity of discrete optimization problems, Ann. Discrete Math. 4 (1979) 121-140.
26. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math. 1 (1977) 343-362.
27. C.U. Martel, Preemptive scheduling with release times, deadlines and due dates, J. ACM 29 (1982) 812-829.
28. R. McNaughton, Scheduling with deadlines and loss functions. Management Sci. 6 (1959) 1-12.
29. R.R. Muntz, E.G. Coffman Jr, Optimal preemptive scheduling on two-processor systems, IEEE Trans. Comput. C-18 (1969) 1014-1020.
30. R.R. Muntz, E.G. Coffman Jr, Preemptive scheduling of real time tasks on multiprocessor systems, J. ACM 17 (1970) 324-338.
31. Yu.N. Sotskov, On the complexity of shop scheduling problems with two or three jobs, EJOR 53 (1991) 326-336.
32. C. Sriskandarajah, P. Ladet, Some no-wait jobs scheduling problems: complexity results. EJOR 24 (1986) 424-438.
33. V.S. Tanaev, Y.N. Sotskov, V.A. Strusewich, Scheduling Theory: Multi-stage Systems, Kluwer, Dordrecht, 1994.
34. V.G. Timkovsky, Computational complexity and approximation of the cycle shop scheduling problem, in: Yu. N. Turin (Ed.), The 1st All-Union Consultation on Statistical and Discrete Analysis of Non-Numerical Information, On Expert Estimates and Discrete Optimization Kazakh State University, Moscow-Alma-Ata, 1981, pp. 220-221 (in Russian).
35. V.G. Timkovsky, On the complexity of scheduling an arbitrary system, Soviet J. Comput. System Sci. (5) (1885) 46-52.
36. V.G. Timkovsky, An approximation for the cycle shop scheduling problem, Ekonomika i Matematicheskije Metodi 22 (1) (1986) 171-174 (in Russian).
37. V.G. Timkovsky, The complexity of unit-time job-shop scheduling, Technical Report. Department of Computer Science and Systems, McMaster University, Hamilton 1993.
38. V.G. Timkovsky, A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem, Discrete Appl. Math. 77 (1997) 185-200.