Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

European Journal of Operational Research

Volumn 149, Issue 2, 2003, Pages 355-376

  Timkovsky, Vadim G ^a,b,c  

^a Star Data Systems Inc   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

^c Telecommunication business unit   (Canada)

Author keywords

Complexity; Parallel machines; Reduction; Scheduling; Shop; Unit processing time

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; JOB ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; TREES (MATHEMATICS);

PARALLEL MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0037846121     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00767-1     Document Type: Conference Paper

References (83)

1. Adiri I., Amit N. Openshop and flowshop scheduling problems to minimize sum of completion times. Computers & Operations Research. 11:1984;275-284.
2. Baptiste P. Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics. 103:2000;21-32.
3. P. Baptiste, On minimizing the weighted number of late jobs in unit execution time open-shops, European Journal of Operational Research, this issue.
4. Baptiste P., Timkovsky V.G. On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters. 28:2001;205-212.
5. H. Bräsel, Lateinische Rechtecke und Machinenbelegung, Dissertation B, TU, Magdeburg, 1990.
6. max problem European Journal of Operational Research. 72:1994;125-134.
7. Bräsel H., Kluge D., Werner F. A polynomial time algorithm for an open shop problem with unit processing times and tree constraints. Discrete Applied Mathematics. 59:1995;11-21.
8. P. Brucker, private communication.
9. Brucker P. Scheduling Algorithms. 1998;Springer, Heidelberg.
10. Brucker P., Garey M.R., Johnson D.S. Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness. Mathematics of Operations Research. 2:1977;275-284.
11. j, Technical Report, University of Osnabrueck, Germany, 2001.
12. Brucker P., Jurisch B., Jurisch M. Open shop problems with unit time operations. ZOR - Methods and Models of Operations Research. 37:1993;59-73.
13. P. Brucker, S. Knust, Operations research: Complexity results of scheduling problems, http://www.mathematik.uni-osnabrueck.de/research/OR/class/.
14. Brucker P., Knust S. Complexity results for single-machine problems with positive finish-start time lags. Computing. 63:1999;299-316.
15. Brucker P., Krämer A. Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. European Journal of Operational Research. 90:1996;214-226.
16. Bruno L., Coffman E.G. Jr., Sethi R. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM. 17:1974;382-387.
17. Bruno J., Jones J.W., So K. Deterministic scheduling with pipelined processors. IEEE Transactions on Computers C. 29:1980;308-316.
18. Cho Y., Sahni S. Preemptive scheduling of independent jobs with release and due dates on open, flow and job shops. Operations Research. 29:1981;511-522.
19. Coffman E.G. Jr., Graham R.L. Optimal scheduling for two-processor systems. Acta Informatica. 1:1972;200-213.
20. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. 1967;Addison-Wesley, Reading, MA.
21. G.I. Davida, D.J. Linton, A new algorithm for scheduling of tree structured tasks, in Proc. Conf. Inform. Sci. and Syst., Baltimore, MD, 1976, pp. 543-548.
22. Dessouky M.I., Lageweg B.J., Lenstra J.K., Van De Velde S.L. Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica. 44:1990;115-123.
23. Du J., Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research. 15(3):1990;483-495.
24. Du J., Leung J.Y.-T. Minimizing mean flow time in two-machine open shops and flow shops. Journal of Algorithms. 14:1993;24-44.
25. Du J., Leung J.Y.-T., Wong C.S. Minimizing the number of late jobs with release time constraints. Journal of Combinatorial Mathematics and Combinatorial Computing. 11:1992;97-107.
26. Du J., Leung J.Y.-T., Young G.H. Minimizing mean flow time with release time constraint. Theoretical Computer Science. 75:1990;347-355.
27. Du J., Leung J.Y.-T., Young G.H. Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation. 92:1991;219-236.
28. Garey M.R., Johnson D.S. Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing. 6:1977;416-426.
29. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP Completeness. 1979;Freeman, San Francisco.
30. Gladky A.A. A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness. European Journal of Operational Research. 103:1997;113-116.
31. Gonzalez T., Johnson D.B. A new algorithm for preemptive scheduling of trees. Journal of the ACM. 27:1980;287-312.
32. Gonzalez T., Sahni S. Openshop scheduling to minimize finish time. Journal of the ACM. 23:1976;665-679.
33. Gonzalez T., Sahni S. Flow shop and job shop schedules: Complexity and approximation. Operations Research. 26:1978;36-52.
34. Horn W.A. Some simple scheduling algorithms. Naval Research Logistics Quarterly. 21:1974;177-185.
35. Horvath E.C., Lam S., Sethi R. A level algorithm for preemptive scheduling. Journal of the ACM. 24:1977;32-43.
36. Hu T.C. Parallel sequencing and assembly line problems. Operations Research. 9:1961;841-848.
37. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
38. Kravchenko S.A. A polynomial time algorithm for a two-machine no-wait job-shop scheduling problem. European Journal of Operational Research. 106:1998;101-107.
39. Kravchenko S.A. On the complexity of minimizing the number of late jobs in unit-time open shop. Discrete Applied Mathematics. 100:1999;127-132.
40. Kravchenko S.A. Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem. Discrete Applied Mathematics. 98(3):1999;209-217.
41. Kubiak W. Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints. Abstracts EURO IX-TIMS XXVIII Paris. 1988;195.
42. Kubiak W. A pseudopolynomial algorithm for a two-machine no-wait job shop problem. European Journal of Operational Research. 43:1989;267-270.
43. Kubiak W., Sethi S., Sriskandarajah C. An efficient algorithm for a job shop problem. Annals of Operations Research. 57:1995;203-216.
44. Kubiak W., Sriskandarajah C., Zaras K. A note on the complexity of open shop scheduling problems. INFOR. 29:1991;284-294.
45. Kubiak W., Timkovsky V.G. 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.
46. Labetoulle J., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Preemptive scheduling of uniform machines subject to release dates. Pulleblank W.R. Progress in Combinatorial Optimization. 1984;245-261 Academic Press, New York.
47. Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics. 1:1977;331-342.
48. E.L. Lawler, Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs, Report BW 105, Centre for Mathematics and Computer Science, Amsterdam, 1979.
49. Lawler E.L. Preemptive scheduling of precedence-constrained jobs on parallel machines. Dempster M.A.H., Lenstra J.K., Rinnooy Kan A.H.G. Deterministic and Stochastic Scheduling. 1982;101-123 Reidel, Dordrecht.
50. Lawler E.L. Recent results in theory of machine scheduling. Bachem A. Mathematical Programming: The State of the Art, Bonn, 1982. 1983;202-234.
51. Lawler E.L., Labetoulle J. On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM. 25:1978;612-619.
52. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Minimizing maximum lateness in a two-machine open shop. Mathematics of Operations Research. 6:1981;153-158 Erratum. 7:1982;635.
53. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P. Handbook on Operations Research and Management Science, Logistics of Production and Inventory. vol. 4:1993;445-552 Elsevier Science Publishers B.V. Amsterdam.
54. Lawler E.L., Martel C.U. Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research. 37:1989;314-318.
55. J.K. Lenstra, private communication.
56. Lenstra J.K., Rinnooy Kan A.H.G. Complexity of scheduling under precedence constraints. Operations Research. 26:1979;22-35.
57. Lenstra J.K., Rinnooy Kan A.H.G. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics. 1:1979;121-140.
58. Lenstra J.K., Rinnooy Kan A.H.G. Complexity results for scheduling chains on a single machine. European Journal of Operational Research. 4:1980;270-275.
59. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 1:1977;343-362.
60. Leung J.T.-Y., Vornberger O., Witthoff J.D. On some variance of the bandwidth minimization problem. SIAM Journal on Computing. 13:1984;650-667.
61. Leung J.T.-Y., Young G.H. Minimizing total tardiness on a single machine with precedence constraints. ORSA Journal on Computing. 2:1990;346-352.
62. Liu C.Y., Bulfin R.L. On the complexity of preemptive open shop scheduling problems. Operations Research Letters. 4:1985;71-74.
63. Liu C.Y., Bulfin R.L. Scheduling open shops with unit execution times to minimize functions of due dates. Operations Research. 36:1988;553-559.
64. I. Lushchakova, Two machine open shop scheduling problem with release dates, unit processing times and precedence constraints, in Book of Abstracts, SOR'99, Magdeburg, 1999, p. 79.
65. Maxwell W.L. On sequencing. n jobs on one machine to minimize the number of late jobs Management Science. 16:1970;295-297.
66. McNaughton R. Scheduling with deadlines and loss functions. Management Science. 6:1959;1-12.
67. Middendorf M., Timkovsky V.G. Transversal graphs for partially ordered sets: Sequencing, scheduling and merging problems. Journal of Combinatorial Optimization. 3(4):1999;417-435.
68. Monma C.L. Linear-time algorithms for scheduling on parallel processors. Operations Research. 30:1982;116-124.
69. Moore J.M. An. n job, one machine sequencing algorithm for minimizing the number of late jobs Management Science. 15:1968;102-109.
70. Muntz R.R., Coffman E.G. Jr. Preemptive scheduling of real time tasks on multiprocessor systems. Journal of the ACM. 17:1970;324-338.
71. Schäffer A.A., Simons B. Computing the bump number with techniques from two-processor scheduling. Order. 5:1988;131-141.
72. Sethi R. Algorithms for minimal-length schedules. Coffman E.G. Jr. Computer and Job-Shop Scheduling Theory. 1976;51-99 John Wiley, New York.
73. Simons B. Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing. 12:1983;294-299.
74. Simons B., Warmuth M. A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing. 18:1989;690-710.
75. Sriskandarajah C., Ladet P. Some no-wait jobs scheduling problems: Complexity results. European Journal of Operational Research. 24:1986;424-438.
76. Tanaev V.S., Sotskov Y.N., Strusevich V.A. Scheduling Theory: Multi-Stage Systems. 1994;Kluwer, Dordrecht.
77. Tautenhahn T., Woeginger G.J. Minimizing the total completion time in a unit-time open shop with release times. Operations Research Letters. 20:1997;207-212.
78. Timkovsky V.G. On the complexity of scheduling an arbitrary system. Soviet Journal of Computer and System Sciences. (5):1985;46-52.
79. Timkovsky V.G. A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem. Discrete Applied Mathematics. 77:1997;185-200.
80. Timkovsky V.G. Is a unit-time job shop not easier than identical parallel machines? Discrete Applied Mathematics. 85:1998;149-162.
81. V.G. Timkovsky, Scheduling unit-time operation jobs on identical parallel machines and in a flow shop: Complexity and correlation, Technical Report No. 98-03, Department of Computer Science and Systems, McMaster University, Hamilton, Ontario, 1998.
82. Ullman J.D. NP-complete scheduling problems. Journal of Computer and System Sciences. 10:1975;384-393.
83. Ullman J.D. Complexity of sequencing problems. Coffman E.G. Jr. Computer and Job-Shop Scheduling Theory. 1976;139-164 John Wiley, New York.