Fifty years of scheduling: a survey of milestones

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.

[1]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[2]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

[3]  J. R. Jackson.  SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .

[4]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[5]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[6]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[7]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[8]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[9]  J. Piehler,et al.  Ein Beitrag zum Reihenfolgeproblem , 1960, Unternehmensforschung.

[10]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[11]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[12]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[13]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[14]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[15]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[16]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[17]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[18]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[19]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[20]  T. A. J. Nicholson,et al.  A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems , 1967 .

[21]  Ichiro Nabeshima,et al.  ON THE BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM , 1967 .

[22]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[23]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[24]  Wlodzimierz Szwarc.  On some sequencing problems , 1968 .

[25]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[26]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[27]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[28]  B. L. Fox,et al.  Searching for the Multiplier in One-Constraint Optimization Problems , 1970, Oper. Res..

[29]  L. B. J. M. Sturm.  A Simple Optimality Proof of Moore's Sequencing Algorithm , 1970 .

[30]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[31]  D. de Werra,et al.  On some combinatorial problems arising in scheduling , 1970 .

[32]  John M. Charlton,et al.  A Method of Solution for General Machine-Scheduling Problems , 1970, Oper. Res..

[33]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[34]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[35]  Jatinder N. D. Gupta,et al.  Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem , 1971, Oper. Res..

[36]  W. Szwarc.  Elimination methods in the m × n sequencing problem , 1971 .

[37]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[38]  S. S. Reddi.  Note On “Optimal Production Schedules For Flow Shops” , 1972 .

[39]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[40]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[41]  Wlodzimierz Szwarc.  Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem , 1973, Oper. Res..

[42]  M. Florian,et al.  On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem , 1973 .

[43]  H. Gantt.  Work, Wages, and Profits , 1973 .

[44]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[45]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[46]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[47]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[48]  L. Gelders,et al.  Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..

[49]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[50]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[51]  Ludo Gelders,et al.  Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..

[52]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[53]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[54]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[55]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[56]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[57]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[58]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[59]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[60]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[61]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[62]  John L. Bruno,et al.  Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[63]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[64]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[65]  Chris N. Potts,et al.  An adaptive branching rule for the permutation flow-shop problem , 1980 .

[66]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[67]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[68]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[69]  Harold N. Gabow,et al.  Algorithms for edge coloring bipartite graphs , 1978, STOC '78.

[70]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[71]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[72]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[73]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[74]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[75]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[76]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[77]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[78]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[79]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[80]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[81]  Eugene L. Lawler,et al.  Scheduling open shops with parallel machines , 1982, Oper. Res. Lett..

[82]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[83]  J. Carlier.  The one-machine sequencing problem , 1982 .

[84]  B. J. Lageweg,et al.  Computer-Aided complexity classification of combinational problems , 1982, CACM.

[85]  Charles U. Martel,et al.  Preemptive Scheduling with Release Times, Deadlines, and Due Times , 1982, JACM.

[86]  Harold N. Gabow,et al.  Algorithms for Edge Coloring Bipartite Graphs and Multigraphs , 1982, SIAM J. Comput..

[87]  Michael Pinedo,et al.  Stochastic Shop Scheduling: A Survey , 1982 .

[88]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[89]  C. Monma,et al.  A concise survey of efficiently solvable special cases of the permutation flow-shop problem , 1983 .

[90]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[91]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[92]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[93]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[94]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[95]  W. Pulleyblank.  Progress in combinatorial optimization , 1985 .

[96]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[97]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[98]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

[99]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1986, FSTTCS.

[100]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[101]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[102]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[103]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[104]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[105]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

[106]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[107]  D. de Werra,et al.  Graph-theoretical models for preemptive scheduling , 1989 .

[108]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[109]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[110]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[111]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[112]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[113]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[114]  J. A. Hoogeveen,et al.  Scheduling around a small common due date , 1991 .

[115]  Hirofumi Matsuo,et al.  A controlled search simulated annealing method for the single machine weighted tardiness problem , 1990 .

[116]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[117]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[118]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[119]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[120]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[121]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[122]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

[123]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[124]  Jan Karel Lenstra,et al.  History of mathematical programming : a collection of personal reminiscences , 1991 .

[125]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[126]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[127]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[128]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[129]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[130]  Stephen P. Smith,et al.  Experiment on using genetic algorithms to learn scheduling heuristics , 1992, Defense, Security, and Sensing.

[131]  Steve Weal.  History of Mathematical Programming , 1992 .

[132]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[133]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[134]  Vitaly A. Strusevich,et al.  Approximation Algorithms for Three-Machine Open Shop Scheduling , 1993, INFORMS J. Comput..

[135]  Ulf Kleinau.  Two-machine shop scheduling problems with batch processing , 1993 .

[136]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[137]  Sergey Vasil'evich Sevast'janov,et al.  on Some Geometric Methods in Scheduling Theory: A Survey , 1994, Discret. Appl. Math..

[138]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[139]  Bruce E. Rosen,et al.  A simulated annealing approach to job shop scheduling using critical block transition operators , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[140]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[141]  Han Hoogeveen,et al.  New Lower and Upper Bounds for Scheduling Around a Small Common Due Date , 1994, Oper. Res..

[142]  Sergey Vasil'evich Sevast'janov,et al.  Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops , 1995, Math. Oper. Res..

[143]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[144]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[145]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[146]  Gerard Brady,et al.  Errata , 1897, Current Biology.

[147]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[148]  B. Müller,et al.  Solution of the Traveling-Salesman Problem , 1995 .

[149]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[150]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[151]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[152]  Chris N. Potts,et al.  A New Heuristic for Three-Machine Flow Shop Scheduling , 1996, Oper. Res..

[153]  Peter Brucker,et al.  Improving Local Search Heuristics for Some Scheduling Problems-I , 1996, Discret. Appl. Math..

[154]  Han Hoogeveen,et al.  Optimal On-Line Algorithms for Single-Machine Scheduling , 1996, IPCO.

[155]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[156]  Dorit S. Hochbaum,et al.  Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime , 1997, Oper. Res..

[157]  Peter Brucker,et al.  Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..

[158]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[159]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[160]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[161]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

[162]  Chris N. Potts,et al.  Approximation algorithms for two-machine flow shop scheduling with batch setup times , 1998, Math. Program..

[163]  Eric Sanlaville,et al.  Machine scheduling with availability constraints , 1998, Acta Informatica.

[164]  Leslie A. Hall.  Approximability of flow shop scheduling , 1998, Math. Program..

[165]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[166]  Jan Karel Lenstra,et al.  The mystical power of twoness : in memoriam Eugene L. Lawler , 1998 .

[167]  Gerhard J. Woeginger,et al.  Makespan minimization in open shops: A polynomial time approximation scheme , 1998, Math. Program..

[168]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[169]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[170]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..

[171]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem , 1999, Oper. Res..

[172]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[173]  C. R. Reeves,et al.  Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..

[174]  TransportationConsiderationsChung,et al.  Machine Scheduling with Transportation Considerations , 2000 .

[175]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[176]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[177]  Vitaly A. Strusevich,et al.  Group technology approach to the open shop scheduling problem with batch setup times , 2000, Oper. Res. Lett..

[178]  Liu Zhao.  Scheduling Groups of Jobs in Two-machine Open Shop , 2000 .

[179]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[180]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[181]  Petra Schuurman,et al.  Performance Guarantees of Local Search for Multiprocessor Scheduling , 2001, INFORMS J. Comput..

[182]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[183]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[184]  Han Hoogeveen,et al.  Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..

[185]  John E. Beasley,et al.  Scheduling aircraft landings at London Heathrow using a population heuristic , 2001, J. Oper. Res. Soc..

[186]  C.-Y. Lee,et al.  Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[187]  Chris N. Potts,et al.  Scheduling batches with simultaneous job processing for two-machine shop problems , 2001 .

[188]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[189]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[190]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[191]  Chris N. Potts,et al.  On-line scheduling of a single machine to minimize total weighted completion time , 2002, SODA '02.

[192]  Maxim Sviridenko,et al.  A linear time approximation scheme for makespan minimization in an open shop with release dates , 2002, Oper. Res. Lett..

[193]  Peter Brucker,et al.  Sequencing and scheduling , 2003, Eur. J. Oper. Res..

[194]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

[195]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[196]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[197]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[198]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[199]  C. T. Ng,et al.  An FPTAS for scheduling a two‐machine flowshop with one unavailability interval , 2004 .

[200]  U. Aickelin,et al.  Parallel Problem Solving from Nature - PPSN VIII , 2004, Lecture Notes in Computer Science.

[201]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[202]  René Sitters,et al.  Complexity of preemptive minsum scheduling on unrelated parallel machines , 2005, J. Algorithms.

[203]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[204]  Edmund K. Burke,et al.  Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport , 2007, Transp. Sci..

[205]  Zhi-Long Chen,et al.  Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems , 2007, Oper. Res..

[206]  Jean-Charles Billaut,et al.  An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times , 2008 .

[207]  Icbiro Nabebhima.  THE ORDER OF n ITEMS PROCESSED ON m MACHINES , 2009 .

[208]  Chris N. Potts,et al.  Approximation results for flow shop scheduling problems with machine availability constraints , 2009, Comput. Oper. Res..

[209]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[210]  Zhi-Long Chen,et al.  Integrated Production and Outbound Distribution Scheduling: Review and Extensions , 2010, Oper. Res..