Skip to main content
Article thumbnail
Location of Repository

Fifty years of scheduling: a survey of milestones

By Christopher N. Potts and Vitaly A. Strusevich

Abstract

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models

Topics: TA
Year: 2009
OAI identifier: oai:eprints.soton.ac.uk:145495
Provided by: e-Prints Soton

Suggested articles

Citations

  1. (1958a). Linear Programming with Pattern Constraints.
  2. (1958b). A solution to the traveling-salesman problem. Presentation at the American Summer Meeting of the Econometric Society,
  3. (1977). A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. doi
  4. (1985). A branch and bound algorithm for the total weighted tatrdiness problem. doi
  5. (1965). A branch-and-bound algorithm for the exact solution of the threemachine scheduling problem. doi
  6. (1983). A concise survey of efficiently solvable cases of the permutation flow-shop problem.
  7. (1988). A controlled search simulated annealing method for the general problem, Working paper 03-04-88,
  8. (1989). A controlled search simulated annealing method for the single machine weighted tardiness problem. doi
  9. (1982). A decomposition algorithm for the single machine total tardiness problem. doi
  10. (1976). A dual algorithm for the one-machine scheduling problem. doi
  11. (1996). A fast taboo search algorithm for the job shop problem. doi
  12. (1996). A fast tabu search algorithm for the permutation flow-shop problem. doi
  13. (1999). A fully polynomial approximation scheme for weighted earliness-tardiness problem. doi
  14. (1969). A functional equation and its application to resource allocation and sequencing problems. doi
  15. (1978). A general bounding scheme for the permutation flow-shop problem. doi
  16. (1992). A genetic algorithm applicable to large-scale job-shop problems. In:
  17. (1995). A genetic algorithm for flowshop sequencing. doi
  18. (1991). A genetic algorithm for job shop. In: doi
  19. (1995). A genetic algorithm for the job shop problem. doi
  20. (2002). A linear time approximation scheme for makespan minimization in an open shop with release dates. doi
  21. (1958). A method for solving traveling salesman problems. doi
  22. (1970). A method of solution for general machine scheduling problems. doi
  23. (1994). A new adaptive multi-start technique for combinatorial global optimizations. doi
  24. (1996). A new heuristic for three-machine flow shop scheduling. doi
  25. (1989). A new heuristic method for the flow shop sequencing problem. doi
  26. (1984). A new polynomial-time algorithm for linear programming. In: doi
  27. (1955). A non-numerical approach to production scheduling problems. doi
  28. (1979). A polynomial algorithm in linear programming.
  29. (1988). A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximating approach. doi
  30. (1988). A polynomial-time algorithm for an approximate solution of a scheduling problem (in Russian).
  31. (1968). A proof of the shortest remaining processing time processing discipline. Opns Res 16: 687–690. Schrage L (1970A). Solving resource-constrained network problems by implicit enumeration – nonpremptive case.
  32. (1967). A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three scheduling problems. doi
  33. (1970). A simple optimality proof of Moore’s sequencing algorithm. doi
  34. (1994). A simulated annealing approach to job shop scheduling using critical block transition operators. In: doi
  35. (2002). A survey of very large-scale neighborhood search techniques. doi
  36. (1982). Algorithms for edge coloring bipartite graphs and multigraphs. doi
  37. (1976). Algorithms for scheduling independent tasks. doi
  38. (1980). An adaptive branching rule for the permutation flow-shop problem. doi
  39. (1965). An algorithm for finding optimal or near optimal solutions to the production scheduling problem.
  40. (1983). An algorithm for single machine sequencing with deadlines to minimize total weighted completion time. doi
  41. (1983). An algorithm for single machine sequencing with release dates to minimize total weighted completion time. doi
  42. (1982). An algorithm for solving the job-shop problem. doi
  43. (1960). An automatic method of solving discrete programming problems. doi
  44. (1956). An extension of Johnson’s result on job lot scheduling. doi
  45. (2004). An FPTAS for scheduling a two-machine flowshop with one unavailability interval. doi
  46. (2008). An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times. doi
  47. (1971). An improved combinatorial algorithm for the flowshop-scheduling problem, doi
  48. (1971). An improved method for scheduling independent tasks. doi
  49. (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. doi
  50. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. doi
  51. (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines. doi
  52. (1998). and Vazacopoulos A doi
  53. (1965). Application of the branch-and-bound technique to some flow-shop scheduling problems. doi
  54. (1993). Applying tabu-search to the job-shop scheduling problem. doi
  55. (1998). Approximability of flow shop scheduling. doi
  56. (1990). Approximation algorithms for scheduling unrelated parallel machines. doi
  57. (1993). Approximation algorithms for three-machine open shop scheduling. doi
  58. (1998). Approximation algorithms for two-machine flow shop scheduling with batch setup times. doi
  59. (2009). Approximation results for flow shop scheduling problems with machine availability constraints. doi
  60. (1999). Approximation schemes for minimizing average weighted completion time with release dates. In: doi
  61. (1966). Bounds for certain multiprocessing anomalies. doi
  62. (1969). Bounds on multiprocessing timing anomalies. doi
  63. (1977). Complexity of machine scheduling problems. doi
  64. (2005). Complexity of preemptive minsum scheduling on unrelated parallel machines. doi
  65. (1978). Complexity of scheduling under precedence constraints. doi
  66. (1978). Complexity of task sequencing with deadlines, set-up times and changeover costs. doi
  67. (1982). Computer aided complexity classification of combinatorial problems. doi
  68. (1965). Computer solutions of the traveling salesman problem. doi
  69. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman: doi
  70. (2001). Convex quadratic and semidefinite programming relaxations in scheduling. doi
  71. (1974). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part I, Theory. doi
  72. (1975). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part II, Computation and structure. doi
  73. (1964). Das Reinenfolgeproblem in der Fertigungsprogrammierung und Linearplanung mit logischen Bedingungen.
  74. (1991). Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. doi
  75. (1991). Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. doi
  76. (1960). Ein Beitrag zum Reihenfolge problem. doi
  77. (1971). Elimination methods in the m × n sequencing problem. doi
  78. (1995). Evolution based learning in a job shop scheduling environment. doi
  79. (1976). Exact and approximate algorithms for scheduling nonidentical processors. doi
  80. (1992). Experiment of using genetic algorithms to learn scheduling heuristics. doi
  81. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. doi
  82. (1978). Flow shop and job shop schedules: complexity and approximation.
  83. (1967). Flow-shop scheduling with the branch-and-bound method, doi
  84. (1986). Future paths for integer programming and links to artificial intelligence. doi
  85. (1989). Graph-theoretical models for preemptive scheduling. In: doi
  86. (2000). Group technology approach to the open shop scheduling problem with batch setup times. doi
  87. (2007). Hybrid metaheuristics to aid runway scheduling at London Heathrow airport. doi
  88. (1996). Improving local search heuristics for some scheduling problems—I. doi
  89. (1997). Improving local search heuristics for some scheduling problems. Part II. doi
  90. (1963). Industrial Scheduling.
  91. (1976). Integer programming approaches to the travelling salesman problem. doi
  92. (2009). Integrated production and outbound distribution scheduling: review and extensions. Opns Res, doi
  93. (1992). Integrating scheduling with batching and lotsizing: a review of algorithms and complexity. doi
  94. (1974). Introduction to Sequencing and Scheduling, doi
  95. (1985). Job shop scheduling with genetic algorithms. In: doi
  96. (1999). Landscapes, operators and heuristic search.
  97. (1964). Les problem` es d’ordonnancement avec contraintes disjonctives.
  98. (1998). Local search heuristics for the single machine total weighted tardiness scheduling problem. doi
  99. (2001). Machine scheduling with a rate-modifying activity. doi
  100. (1998). Machine scheduling with availability constraints. doi
  101. (2004). Machine scheduling with availability constraints. In: Leung J Y-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapman & Hall/CRC: Boca Raton, FL,
  102. (2001). Machine scheduling with transportation considerations. doi
  103. (1998). Makespan minimization in open shops: a polynomial time approximation scheme. doi
  104. (1975). Minimizing total costs in onemachine scheduling. doi
  105. (1990). Minimizing total tardiness on one processor is NP-hard. doi
  106. (1982). Nearly optimum solution of multi-machine scheduling problems (in Hungarian).
  107. (1994). New lower and upper bounds for scheduling around a small common due date. doi
  108. (1992). New search spaces for sequencing problems with application to job shop scheduling. doi
  109. (2001). Non-approximability results for scheduling problems with minsum criteria. doi
  110. (1991). Old stories. In: Lenstra JK, Rinnooy Kan AHG and Schrijver A (eds). History of Mathematical Programming. A Collection of Personal Reminiscences. CWI and North-Holland: Amsterdam,
  111. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. doi
  112. (1964). On scheduling problems with deferral costs. doi
  113. (1975). On scheduling with ready times and due dates to minimize maximum lateness. doi
  114. (1973). On sequencing with earliest start and due dates with application to computing bounds for the (n|m|G|Fmax) problem. doi
  115. (1970). On some combinatorial problems arising in scheduling.
  116. (1994). On some geometric methods in scheduling theory: a survey.
  117. (1968). On some sequencing problems. doi
  118. (1967). On the bound of makespans and its application in M machine scheduling problem.
  119. (1989). On the complexity of scheduling with batch setup times. doi
  120. (1972). On the N-job, one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-bound solution. doi
  121. (1980). On the symmetric travelling salesman problem: a computational study. doi
  122. (1980). On the symmetric travelling salesman problem: solution of a 120-city problem. doi
  123. (1969). One-machine sequencing to minimize certain functions of job tardiness. doi
  124. (2004). Online scheduling of a single machine to minimize total weighted completion time. doi
  125. (2004). Online scheduling. In: Leung JY-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapman & Hall/CRC: Boca Raton, FL,
  126. (1976). Open shop scheduling to minimize finish time. doi
  127. (1973). Optimal elimination methods in the m × n sequencing problem. doi
  128. (1996). Optimal online algorithms for single-machine scheduling. In: doi
  129. (1969). Optimal production schedules for flow shops,
  130. (1954). Optimal two- and three-stage production schedules with setup times included. doi
  131. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. doi
  132. (1983). Optimization by simulated annealing, doi
  133. (1999). Parallel machine scheduling by column generation. doi
  134. (1994). Parallel taboo search techniques for the job shop scheduling problem doi
  135. (1965). Paths, trees, and flowers. doi
  136. (2001). Performance guarantees of local search for multiprocessor scheduling. In: doi
  137. (2006). Planning machine maintenance in two-machine shop scheduling. doi
  138. (1999). Polynomial time approximation algorithms for machine scheduling: Ten open problems. doi
  139. (1986). Preemptive scheduling of uniform machines by ordinary network flow techniques. doi
  140. (1984). Preemptive scheduling of uniform machines subject to release dates. In: doi
  141. (1982). Preemptive scheduling with release times, deadlines and due times. doi
  142. (1982). Recent developments in deterministic sequencing and scheduling: A survey. In: doi
  143. (1972). Reducibility among combinatorial problems. In: doi
  144. (1998). Scheduling a batching machine. doi
  145. (1955). Scheduling a production line to minimize maximum tardiness.
  146. (2001). Scheduling aircraft landings at London Heathrow using a population heuristic. doi
  147. (1995). Scheduling Algorithms. doi
  148. (1991). Scheduling around a small common due date. doi
  149. (2001). Scheduling batches with simultaneous job processing for two-machine shop problems. doi
  150. (2000). Scheduling groups of jobs in two-machine open shop.
  151. (1993). Scheduling in Computer and Manufacturing Systems.
  152. (1966). Scheduling independent tasks on independent processors. doi
  153. (1974). Scheduling independent tasks to reduce mean finishing time. doi
  154. (2000). Scheduling jobs and maintenance activities on parallel machines. doi
  155. (1982). Scheduling open shops with parallel machines. doi
  156. (1997). Scheduling semiconductor burn-in operations to minimize total flowtime. doi
  157. (1989). Scheduling Theory. Multi-Stage System (in Russian). Nauka: Moscow; English translation by Kluwer:
  158. (1984). Scheduling Theory. Single-Stage Systems (in Russian). Nauka: Moscow; English translation by Kluwer: doi
  159. (1997). scheduling to minimize average completion time: off-line and on-line approximation algorithms. doi
  160. (1996). Scheduling with an availability constraint. doi
  161. (2000). Scheduling with batching: A review. doi
  162. (1959). Scheduling with deadlines and loss functions. doi
  163. (1993). Scheduling with delivery and earliness penalties. doi
  164. (2000). Scheduling with limited machine availability. doi
  165. (1995). Scheduling: Theory, Algorithms, and Systems. doi
  166. (1964). Sequencing a one–state variable machine: a solvable case of the traveling salesman problem. doi
  167. (1993). Sequencing and scheduling: Algorithms and complexity. In: doi
  168. (1997). Sequencing and scheduling. In:
  169. (1978). Sequencing jobs to minimize total weighted completion time subject to precedence constraints. doi
  170. (1990). Sequencing with earliness and tardiness penalties: a review. doi
  171. (1979). Sequencing with series-parallel precedence constraints. doi
  172. (1997). Short shop schedules. doi
  173. (1989). Simulated annealing for permutation flow-shop scheduling. doi
  174. (1991). Single machine scheduling polyhedra with precedence constraints. doi
  175. (1991). Single machine tardiness sequencing heuristics. doi
  176. (1980). Solving large-scale symmetric travelling salesman problems to optimality. doi
  177. (1999). Solving parallel machine scheduling problems by column generation. doi
  178. (1993). Solving the job shop scheduling problem with tabu search. doi
  179. (1990). Some efficient heuristic methods for the flow shop sequencing problem. doi
  180. (1974). Some simple scheduling algorithms.
  181. (1979). Special Purpose Algorithms for One-Machine Sequencing Problems with Single and Composite Objectives.
  182. (1982). Stochastic shop scheduling: A survey. In: doi
  183. (1993). Supply chain scheduling: Batching and delivery. doi
  184. (2007). Supply chain scheduling: Conflict and cooperation in assembly systems. doi
  185. (1989). Tabu search: Part I. doi
  186. (1990). Tabu search: Part II. doi
  187. (1990). The application of the simulated annealing algorithm to the solution of the n|m|Cmax flowshop problem. doi
  188. (1976). The complexity of flowshop and jobshop scheduling. doi
  189. (1971). The complexity of theorem–proving procedures. In: doi
  190. (1974). The Job-Machine Scheduling Problem.
  191. (1998). The mystical power of twoness: in memoriam doi
  192. (1968). The one-machine sequencing problem with delay costs.
  193. (1982). The one-machine sequencing problem. doi
  194. (1961). The order of n items processed on m machines:
  195. (1988). The shifting bottleneck procedure for job shop scheduling. doi
  196. (1971). The traveling-salesman problem and minimum spanning trees: Part II. doi
  197. (1967). Theory of Scheduling.
  198. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. doi
  199. (1993). Two–machine shop scheduling problems with batch processing. doi
  200. (1978). Using cutting planes to solve the symmetric travelling salesman problem. doi
  201. (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results. doi
  202. (1974). Validation of subgradient optimization. doi
  203. (1956). Various optimizers for single-stage production. doi
  204. (1995). Vector summation in Banach space and polynomial time algorithms for flow shops and open shops. doi
  205. (1916). Work, Wages, and Profits, 2nd edition. Engineering Magazine Co: New York. Reprinted by Hive Publishing Company:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.