Optimization and approximation in deterministic sequencing and scheduling: A survey

Annals of Discrete Mathematics

Volumn 5, Issue C, 1979, Pages 287-326

  Graham, R L ^a   Lawler, E L ^b   Lenstra, J K ^c   Kan, A H G Rinnooy ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CWI   (Netherlands)

^d ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 74849101820     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70356-X     Document Type: Article

References (153)

1. Adolphson, D., Single machine job sequencing with precedence constraints. SIAM J. Comput. 6 (1977), 40–54.
2. Adolphson, D., Hu, T.C., Optimal linear ordering. SIAM J. Appl. Math. 25 (1973), 403–423.
3. Aho, A.V., Garey, M.R., Ullman, J.D., The transitive reduction of a directed graph. SIAM J. Comput. 1 (1972), 131–137.
4. Baer, J.L., Optimal scheduling on two processors with different speeds. Gelenbe, E., Mahl, R., (eds.) Computer Architectures and Networks, 1974, North-Holland, Amsterdam, 27–45.
5. Baker, K.R., Introduction to Sequencing and Scheduling, 1974, Wiley, New York.
6. Baker, K.R., Merten, A.G., Scheduling with parallel processors and linear delay costs. Naval Res. Logist. Quart. 20 (1973), 793–804.
7. Baker, K.R., Schrage, L.E., Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks. Operations Res. 26 (1978), 111–120.
8. Baker, K.R., Su, Z.-S., Sequencing with due-dates and early start times to minimize maximum tardiness. Naval Res. Logist. Quart. 21 (1974), 171–176.
9. Bakshi, M.S., Arora, S.R., The sequencing problem, Management Sci. 16 (1969), B247–B263.
10. Barnes, J.W., Brennan, J.J., An improved algorithm for scheduling jobs on identical machines. AIIE Trans. 9 (1977), 25–31.
11. Bratley, P., Florian, M., Robillard, P., Scheduling with earliest start and due date constraints on multiple machines. Naval Res. Logist. Quart. 22 (1975), 165–173.
12. Brucker, P., Garey, M.R., Johnson, D.S., Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Math. Operations Res. 2 (1977), 275–284.
13. Bruno, J., Coffman, E.G. Jr., Sethi, R., Scheduling independent tasks to reduce mean finishing time. Comm. ACM 17 (1974), 382–387.
14. J. Bruno and T. Gonzalez (1976), Scheduling independent tasks with release dates and due dates on parallel machines, Technical Report 213, Computer Science Department, Pennsylvania State University.
15. F. Burns and J. Rooker (1976), 3xn Flow-shops with convex external stage time dominance (unpublished manuscript).
16. Chandra, A.K., Wong, C.K., Worst-case analysis of a placement algorithm related to storage allocation. SIAM J. Comput. 4 (1975), 249–263.
17. Charlton, J.M., Death, C.C., A generalized machine scheduling algorithm. Operational Res. Quart. 21 (1970), 127–134.
18. N.-F. Chen (1975), An analysis of scheduling algorithms in multiprocessing computing systems, Technical Report UIUCDCS-R-75–724, Department of Computer Science, University of Illinois at Urbana-Champaign.
19. Chen, N.-F., Liu, C.L., On a class of scheduling algorithms for multiprocessors computing systems. Feng, T.-Y., (eds.) Parallel Processing, Lecture Notes in Computer Science, 24, 1975, Springer, Berlin, 1–16.
20. Coffman, E.G. Jr., (eds.) Computer and Job-Shop Scheduling Theory, 1976, Wiley, New York.
21. E.G. Coffman, Jr., M.F. Garey and D.S. Johnson (1978), An application of bin-packing to multiprocessor scheduling, SIAM J. Comput., to appear.
22. Coffman, E.G. Jr., Graham, R.L., Optimal scheduling for two-processor systems. Acta Informat. 1 (1972), 200–213.
23. Conway, R.W., Maxwell, W.L., Miller, L.W., Theory of Scheduling, 1967, Addison-Wesley, Reading, MA.
24. Davis, E.W., Resource allocation in project network models ? a survey. J. Indust. Engrg. 17 (1966), 177–188.
25. Davis, E.W., Project scheduling under resource constraints ? historical review and categorization of procedures. AIIE Trans. 5 (1973), 297–313.
26. Day, J., Hottenstein, M.P., Review of scheduling research. Naval Res. Logist. Quart. 17 (1970), 11–39.
27. Denning, P.J., Scott Graham, G., A note on subexpression ordering in the execution of arithmetic expressions. Comm. ACM 16 (1973), 700–702.
28. Eastman, W.L., Even, S., Isaacs, I.M., Bounds for the optimal scheduling of n jobs on m processors. Management Sci. 11 (1964), 268–279.
29. Elmaghraby, S.E., Park, S.H., Scheduling jobs on a number of identical machines. AIIE Trans. 6 (1974), 1–12.
30. Fisher, M.L., Optimal solution of scheduling problems using Lagrange multipliers. part I, Operations Res. 21 (1973), 1114–1127.
31. Fisher, M.L., A dual algorithm for the one-machine scheduling problem. Math. Programming 11 (1976), 229–251.
32. Fujii, M., Kasami, T., Ninomiya, K., Optimal sequencing of two equivalent processors. SIAM J. Appl. Math. 17 (1969), 784–789.
33. Erratum., 20, 1971, 141 1971.
34. M.R. Garey (−), Unpublished.
35. Garey, M.R., Graham, R.L., Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4 (1975), 187–200.
36. Garey, M.R., Graham, R.L., Johnson, D.S., Performance guarantees for scheduling algorithms. Operations Res. 26 (1978), 3–21.
37. M.R. Garey, R.L. Graham and D.S. Johnson (−), Unpublished. M.R. Garey, R.L. Graham, D.S. Johnson and A.C.-C. Yao (1976a), Resource constrained scheduling as generalized bin packing, J. Combinatorial Theory Ser. A 21, 257–298.
38. Garey, M.R., Johnson, D.S., Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4 (1975), 397–411.
39. Garey, M.R., Johnson, D.S., Scheduling tasks with nonuniform deadlines on two processors. J. Assoc. Comput. Mach. 23 (1976), 461–467.
40. Garey, M.R., Johnson, D.S., Approximation algorithms for combinatorial problems: an annotated bibliography. Traub, J.F., (eds.) Algorithms and Complexity: New Directions and Recent Results, 1976, Academic Press, New York, 41–52.
41. Garey, M.R., Johnson, D.S., Two-processor scheduling with start-times and deadlines. S1AM J. Comput. 6 (1977), 416–426.
42. Garey, M.R., Johnson, D.S., Sethi, R., The complexity of flowshop and jobshop scheduling. Math. Operations Res. 1 (1976), 117–129.
43. Gelders, L., Kleindorfer, P.R., Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: part I. Theory, Operations Res. 22 (1974), 46–60.
44. Gelders, L., Kleindorfer, P.R., Coordinating aggregate and detailed scheduling in the one-machine job shop: II—computation and structure. Operations Res. 23 (1975), 312–324.
45. Gere, W.S., Heuristics in job shop scheduling. Management Sci. 13 (1966), 167–190.
46. Giffler, B., Thompson, G.L., Algorithms for solving production-scheduling problems. Operations Res. 8 (1960), 487–503.
47. Gilmore, P.C., Gomory, R.E., Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Res. 12 (1964), 655–679.
48. T. Gonzalez (1976), A note on open shop preemptive schedules, Technical Report 214, Computer Science Department, Pennsylvania State University.
49. T. Gonzalez (1977), Optimal mean finish time preemptive schedules, Technical Report 220, Computer Science Department, Pennsylvania State University.
50. Gonzalez, T., Ibarra, O.H., Sahni, S., Bounds for LPT schedules on uniform processors. SIAM J. Comput. 6 (1977), 155–166.
51. T. Gonzalez and D.B. Johnson (1977), A new algorithm for preemptive scheduling of trees, Technical Report 222, Computer Science Department, Pennsylvania State University.
52. T. Gonzalez, E.L. Lawler and S. Sahni (1978), Optimal preemptive scheduling of a fixed number of unrelated processors in linear time (to appear).
53. Gonzalez, T., Sahni, S., Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23 (1976), 665–679.
54. Gonzalez, T., Sahni, S., Flowshop and jobshop schedules: complexity and approximation. Operations Res. 26 (1978), 36–52.
55. Gonzalez, T., Sahni, S., Preemptive scheduling of uniform processor systems. J. Assoc. Comput. Mach. 25 (1978), 92–101.
56. D.K. Goyal (1977a), Scheduling equal execution time tasks under unit resource restriction (to appear).
57. D.K. Goyal (1977b), Non-preemptive scheduling of unequal execution time tasks on two identical processors. Technical Report CS-77–039, Computer Science Department, Washington State University, Pullman.
58. Graham, R.L., Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45 (1966), 1563–1581.
59. Graham, R.L., Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17 (1969), 263–269.
60. Graham, R.L., Bounds on the performance of scheduling algorithms, in, 1976, Coffman, 165–227.
61. R.L. Graham (−), Unpublished. J.N.D. Gupta and S.S. Reddi (1978), Improved dominance conditions for the three-machine flowshop scheduling problem, Operations Res. 26, 200–203.
62. Horn, W.A., Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SIAM J. Appl. Math. 23 (1972), 189–202.
63. Horn, W.A., Minimizing average flow time with parallel machines. Operations Res. 21 (1973), 846–847.
64. Horn, W.A., Some simple scheduling algorithms. Naval Res. Logist. Quart. 21 (1974), 177–185.
65. Horowitz, E., Sahni, S., Exact and approximate algorithms for scheduling nonidentical processors. J. Assoc. Comput. Mach. 23 (1976), 317–327.
66. Horvath, E.C., Lam, S., Sethi, R., A level algorithm for preemptive scheduling. J. Assoc. Comput. Mach. 24 (1977), 32–43.
67. Hsu, N.C., Elementary proof of Hu's theorem on isotone mappings. Proc. Amer. Math. Soc. 17 (1966), 111–114.
68. Hu, T.C., Parallel sequencing and assembly line problems. Operations Res. 9 (1961), 841–848.
69. O.H. Ibarra and C.E. Kim (1975), Scheduling for maximum profit, Technical Report, Computer Science Department, University of Minnesota, Minneapolis.
70. Ibarra, O.H., Kim, C.E., On two-processor scheduling of one- or two-unit time tasks with precedence constraints. J. Cybernet. 5 (1976), 87–109.
71. Ibarra, O.H., Kim, C.E., Heuristic algorithms for scheduling independent tasks on nonidenti-cal processors. J. Assoc. Comput. Mach. 24 (1977), 280–289.
72. Ignall, E., Schrage, L., Application of the branch-and-bound technique to some flow-shop scheduling problems. Operations Res. 13 (1965), 400–412.
73. J.R. Jackson (1955), Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles.
74. Jackson, J.R., An extension of Johnson's results on job lot scheduling. Naval Res. Logist. Quart. 3 (1956), 201–203.
75. D.S. Johnson (1973), Near-optimal bin packing algorithms, Report MAC TR-109, Massachusetts Institute of Technology, Cambridge, MA.
76. Johnson, D.S., Fast algorithms for bin packing. J. Comput. System Sci. 8 (1974), 272–314.
77. Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L., Worst-case performance bounds for simple one-dimensional packing algorithms. SI AM J. Comput. 3 (1974), 299–325.
78. Johnson, S.M., Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1 (1954), 61–68.
79. Johnson, S.M., Discussion: Sequencing n jobs on two machines with arbitrary time lags. Management Sci. 5 (1958), 299–303.
80. Kafura, D.G., Shen, V.Y., Task scheduling on a multiprocessor system with independent memories. SIAM J. Comput. 6 (1977), 167–187.
81. D.G. Kafura and V. Y. Shen (1978), An algorithm to design the memory configuration of a computer network, J. Assoc. Comput. Mach. 25, 365–377.
82. Karp, R.M., Reducibility among combinatorial problems. Miller, R.E., Thatcher, J.W., (eds.) Complexity of Computer Computations, 1972, Plenum Press, New York, 85–103.
83. Karp, R.M., On the computational complexity of combinatorial problems. Networks 5 (1975), 45–68.
84. M.T. Kaufman (1972), Anomalies in scheduling unit-time tasks, Technical Report 34, Stanford Electronic Laboratory.
85. Kaufman, M.T., An almost-optimal algorithm for the assembly line scheduling problem. IEEE Trans. Computers C-23 (1974), 1169–1174.
86. Kise, H., Ibaraki, T., Mine, H., A solvable case of the one-machine scheduling problem with ready and due times. Operations Res. 26 (1978), 121–126.
87. D. Knuth (1973), Private communication to T.C. Hu, July 23(1973). K.L. Krause (1973), Analysis of computer scheduling with memory constraints, Doctoral Dissertation, Computer Science Department, Purdue University, West Lafayette.
88. Krause, K.L., Shen, V.Y., Schwetman, H.D., Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. Assoc. Comput. Mach. 22 (1975), 522–550 24 1977, 527.
89. Kunde, M., Beste Schranken beim LP-Scheduling, Bericht 7603, Institut fur Informatik und Praktische Mathematik, 1976, Christian-Albrechts-Universitat Kiel.
90. J. Labetoulle, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1978), Preemptive scheduling of uniform machines subject to release dates (to appear).
91. B.J. Lageweg, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1978a), Computer aided complexity classification of deterministic scheduling problems (to appear).
92. Lageweg, B.J., Lenstra, J.K.A.H.G., Rinnooy Kan, G., Minimizing maximum lateness on one machine: computational experience and some applications. Statistica Neerlandica 30 (1976), 25–41.
93. Lageweg, B.J., Lenstra, J.K.A.H., Rinnooy Kan, G., Job-shop scheduling by implicit enumeration. anagement Sci. 24 (1977), 441–450.
94. Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G., A general bounding scheme for the permutation flow-shop problem. Operations Res. 26 (1978), 53–67.
95. Lam, S., Sethi, R., Worst case analysis of two scheduling algorithms. SI AM J. Comput. 6 (1977), 518–536.
96. Lawler, E.L., Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19 (1973), 544–546.
97. Lawler, E.L., Sequencing to minimize the weighted number of tardy jobs. Rev. Francaise Automat. Informat. Recherche Operationnelle 10 (1976), 27–33 5 Suppl.
98. Lawler, E.L., Combinatorial Optimization: Networks and Matroids, 1976, Holt, Rinehart, and Winston, New York.
99. Lawler, E.L., A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 (1977), 331–342.
100. Lawler, E.L., Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2 (1978), 75–90.
101. E.L. Lawler and J. Labetoulle (1978). On preemptive scheduling of unrelated parallel processors, J. Assoc. Comput. Mach., to appear.
102. Lawler, E.L., Moore, J.M., A functional equation and its application to resource allocation and sequencing problems. Management Sci. 16 (1969), 77–84.
103. Lenstra, J.K., Sequencing by Enumerative Methods, Mathematical Centre Tract 69, 1977, Mathematisch Centrum, Amsterdam.
104. J.K. Lenstra (−), Unpublished. J.K. Lenstra and A.H.G. Rinnooy Kan (1975), Some simple applications of the travelling salesman problem, Operational Res. Quart. 26, 717–733.
105. Lenstra, J.K., Rinnooy Kan, A.H.G., Complexity of scheduling under precedence constraints. Operations Res. 26 (1978), 22–35.
106. Lenstra, J.K., Rinnooy Kan, A.H.G., Computational complexity of discrete optimization problems. Ann. Discrete Math., 4, 1978 1979 Discrete Optimization I.
107. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P., Complexity of machine scheduling problems. Ann. Discrete Math 4 (1977), 281–300.
108. C.L. Liu (1972), Optimal scheduling on multi-processor computing systems, Proc. 13th Annual IEEE Symp. Switching and Automata Theory, 155–160.
109. Liu, C.L., Deterministic job scheduling in computing systems, Department of Computer Science, 1976, University of Illinois at Urbana-Champaign.
110. Liu, J.W.S., Liu, C.L., Bounds on scheduling algorithms for heterogeneous computing systems. Rosenfeld, J.L., (eds.) Information Processing, 74, 1974, North-Holland, Amsterdam, 349–353.
111. J.W.S. Liu and C.L. Liu (1974b), Bounds on schedulling algorithms for heterogeneous computing systems, Technical Report UIUCDCS-R-74–632, Department of Computer Science, University of Illinois at Urbana-Champaign, 68 pp.
112. Liu, J.W.S., Liu, C.L., Performance analysis of heterogeneous multiprocessor computing systems. Gelenbe, E., Mahl, R., (eds.) Computer Architectures and Networks, 1974, North-Holland, Amsterdam, 331–343 1974c.
113. McMahon, G.B., Optimal production schedules for flow shops. Canad. Operational Res. Soc. J. 7 (1969), 141–151.
114. G.B. McMahon (1971), A study of algorithms for industrial scheduling problems, Thesis, University of New South Wales, Kensington.
115. McMahon, G.B., Florian, M., On scheduling with ready times and due dates to minimize maximum lateness. Operations Res. 23 (1975), 475–482.
116. McNaughton, R., Scheduling with deadlines and loss functions. Management Sci. 6 (1959), 1–12.
117. Mitten, L.G., Sequencing n jobs on two machines with arbitrary time lags. Management Sci. 5 (1958), 293–298.
118. Monma, C.L., Optimal m x n flow shop sequencing with precedence constraints and lag times, School of Operations Research, 1977, Cornell University, Ithaca, NY.
119. C.L. Monma and J.B. Sidney (1977), A general algorithm for optimal job sequencing with series-parallel precedence constraints, Technical Report 347, School of Operations Research, Cornell University, Ithaca, NY.
120. Moore, J.M., An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15 (1968), 102–109.
121. Muntz, R.R., Coffman, E.G. Jr., Optimal preemptive scheduling on two-processor systems. IEEE Trans. Computers C-18 (1969), 1014–1020.
122. Muntz, R.R., Coffman, E.G. Jr., Preemptive scheduling of real time tasks on multiprocessor systems. J. Assoc. Comput. Mach. 17 (1970), 324–338.
123. Y. Muraoka (1971), Parallelism, exposure and exploitation in programs, Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign.
124. Muth, J.F., Thompson, G.L., Industrial Scheduling (Prentice-Hall, Englewood Cliffs, NJ) 236. I. Nabeshima (1963), Sequencing on two machines with start lag and stop lag. J. Operations Res. Soc. Japan 5 (1963), 97–101.
125. Panwalkar, S.S., Iskander, W., A survey of scheduling rules. Operations Res. 25 (1977), 45–61.
126. Piehler, J., Ein Beitrag zum Reihenfolgeproblem. Unternehmensforschung 4 (1960), 138–142.
127. Reddi, S.S., Ramamoorthy, C.V., On the flow-shop sequencing problem with no wait in process. Operational Res. Quart. 23 (1972), 323–331.
128. Rinnooy Kan, A.H.G., Machine Scheduling Problems: Classification, Complexity and Computations, 1976, Nijhoff, The Hague.
129. Rinnooy Kan, A.H.G., Lageweg, B.J., Lenstra, J.K., Minimizing total costs in one-machine scheduling. Operations Res. 23 (1975), 908–927.
130. P. Rosenfeld (−), Unpublished. M.H. Rothkopf (1966), Scheduling independent tasks on parallel processors, Management Sci. 12, 437–447.
131. Roy, B., Sussmann, B., Les problemes d'ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, 1964, SEMA, Montrouge.
132. Sahni, S., Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach. 23 (1976), 116–127.
133. Sahni, S., Cho, Y., Scheduling independent tasks with due times on a uniform processor system, Computer Science Department, 1977, University of Minneapolis.
134. Sahni, S., Cho, Y., Nearly on line scheduling of a uniform processor system with release times, Computer Science Department, 1977, University of Minnesota, Minneapolis.
135. S. Sahni and Y. Cho (1977C), Complexity of scheduling jobs with no wait in process, Technical Report 77–20, Computer Science Department, University of Minnesota, Minneapolis.
136. Sethi, R., Algorithms for minimal-length schedules, in, 1976, Coffman, 51–99 1976A.
137. Sethi, R., Scheduling graphs on two processors. SIAM J. Comput. 5 (1976), 73–82.
138. Sethi, R., On the complexity of mean flow time scheduling. Math. Operations Res. 2 (1977), 320–330.
139. J.B. Sidney (1973), An extension of Moore's due date algorithm, in: S.E. Elmaghraby, ed., Symposium on the Theory of Scheduling and its Applications, Lecture Notes in Economics and Mathematical Systems 86 (Springer, Berlin, 1973) 393–398.
140. Sidney, J.B., Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Res. 23 (1975), 283–298.
141. Sidney, J.B., The two-machine maximum flow time problem with series-parallel precedence constraints, 1977, Faculty of Management Sciences, University of Ottawa.
142. Smith, W.E., Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 (1956), 59–66.
143. H.E. Stern (1976), Minimizing makespan for independent jobs on nonidentical parallel machines ? an optimal procedure, Working Paper 2/75, Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva.
144. Szwarc, W., On some sequencing problems. Naval Res. Logist. Quart. 15 (1968), 127–155.
145. Szwarc, W., Elimination methods in the m x n sequencing problem. Naval Res. Logist. Quart. 18 (1971), 295–305.
146. Szwarc, W., Optimal elimination methods in the m x n sequencing problem. Operations Res. 21 (1973), 1250–1259.
147. Szwarc, W., Dominance conditions for the three machine flow-shop problem. Operations Res. 26 (1978), 203–206.
148. Townsend, W., A branch-and-bound method for sequencing problems with linear and exponential penalty functions. Operational Res. Quart. 28 (1977), 191–200.
149. Townsend, W., Sequencing n jobs on m machines to minimise maximum tardiness: a branch-and-bound solution. Management Sci. 23 (1977), 1016–1019.
150. Ullman, J.D., NP-complete scheduling problems. J. Comput. System Sci. 10 (1975), 384–393.
151. Ullman, J.D., Complexity of sequencing problems, in, 1976, Coffman, 139–164.
152. Van Deman, J.M., Baker, K.R., Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Trans. 6 (1974), 28–34.
153. Wismer, D.A., Solution of the flowshop-scheduling problem with no intermediate queues. Operations Res. 20 (1972), 689–697.