Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems

This chapter sets out to present a very important class of production scheduling problems and the main methods employed to solve them. More specifically, after a brief description of single and parallel machines scheduling problems, which constitute the basis of production scheduling research, the main shop scheduling problems are presented (flow shop, job shop, open shop, group shop and mixed shop) followed by an analysis of their computational complexity. Thereafter, the most important exact, heuristic and meta-heuristic methods are presented and classified. Finally, a thorough review for each shop scheduling problem is conducted where the most important methods proposed in the literature, specifically for each problem, are presented.

[1]  Peter Brucker,et al.  A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[2]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[3]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[4]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

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

[6]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[7]  Vladimir Cherkassky,et al.  Scaling neural network for job-shop scheduling , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[8]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[9]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

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

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

[12]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

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

[14]  I. Adiri,et al.  An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem , 1982, Math. Oper. Res..

[15]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[16]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[17]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[18]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

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

[20]  Weijun Xia,et al.  A hybrid particle swarm optimization approach for the job-shop scheduling problem , 2006 .

[21]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[22]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[23]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

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

[25]  L. Darrell Whitley,et al.  Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem , 2005, Comput. Oper. Res..

[26]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[27]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[28]  Norman M. Sadeh,et al.  Focused simulated annealing search: An application to job shop scheduling , 1996, Ann. Oper. Res..

[29]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[30]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[31]  Christian Prins,et al.  Classical and new heuristics for the open-shop problem: A computational evaluation , 1998, Eur. J. Oper. Res..

[32]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[33]  Takeshi Yamada,et al.  Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .

[34]  Haibin Yu,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[35]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[36]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[37]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

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

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

[40]  Subramaniam Balakrishnan,et al.  A neural network to enhance local search in the permutation flowshop , 2005, Comput. Ind. Eng..

[41]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

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

[43]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[44]  I. Adiri,et al.  Open‐shop scheduling problems with dominated machines , 1989 .

[45]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[46]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[47]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[48]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[49]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[50]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

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

[52]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[53]  Cihan H. Dagli,et al.  A parallel genetic-neuro scheduler for job-shop scheduling problems , 1997 .

[54]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[55]  Michael Florian,et al.  A Direct Search Method to Locate Negative Cycles in a Graph , 1971 .

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

[57]  Yoshikazu Nishikawa,et al.  A Parallel Genetic Algorithm based on a Neighborhood Model and Its Application to Jobshop Scheduling , 1993, PPSN.

[58]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

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

[60]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[61]  Frank Werner,et al.  Constructive heuristic algorithms for the open shop problem , 1993, Computing.

[62]  Daniel Merkle,et al.  An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.

[63]  Christian Bierwirth,et al.  Control of Parallel Population Dynamics by Social-Like Behavior of GA-Individuals , 1994, PPSN.

[64]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[65]  A. S. Jain,et al.  Job-shop scheduling using neural networks , 1998 .

[66]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[67]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

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

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

[70]  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..

[71]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

[72]  Harold H. Greenberg.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

[73]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

[75]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[76]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[77]  P. Aravindan,et al.  Constructive and improvement flow shop scheduling heuristics: An extensive evaluation , 2001 .

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

[79]  Mehmet Sevkli,et al.  Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion , 2004 .

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

[81]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[82]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[83]  Kenneth R. Baker,et al.  A Comparative Study of Flow-Shop Algorithms , 1975, Oper. Res..

[84]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[85]  H. L. Ong,et al.  A fast tabu search algorithm for the group shop scheduling problem , 2005, Adv. Eng. Softw..

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

[87]  F. Pettersson,et al.  Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem , 2007, Appl. Math. Comput..

[88]  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).

[89]  H. L. Ong,et al.  Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem , 2004, Adv. Eng. Softw..

[90]  Cihan H. Dagli,et al.  Genetic neuro-scheduler: A new approach for job shop scheduling , 1995 .

[91]  Lawrence J. Fogel,et al.  Toward Inductive Inference Automata , 1962, IFIP Congress.

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

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

[94]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[95]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[96]  Peter B. Luh,et al.  Lagrangian relaxation neural networks for job shop scheduling , 2000, IEEE Trans. Robotics Autom..

[97]  Daniel J. Fonseca,et al.  Artificial neural networks for job shop simulation , 2002, Adv. Eng. Informatics.

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

[99]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[100]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[101]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[102]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[103]  Peter Brucker,et al.  A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs , 1994 .

[104]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[105]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[106]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[107]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[108]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[109]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[110]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[111]  Ihsan Sabuncuoglu,et al.  A neural network model for scheduling problems , 1996 .

[112]  Christos Koulamas,et al.  Open shop scheduling with makespan and total completion time criteria , 2000, Comput. Oper. Res..

[113]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[114]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

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

[116]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[117]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[118]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[119]  Michael J. Shaw,et al.  A neural-net approach to real time flow-shop sequencing , 2000 .

[120]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[121]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[122]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[123]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

[124]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[125]  Fuqing Zhao,et al.  An Improved Particle Swarm Optimization-Based Approach for Production Scheduling Problems , 2006, 2006 International Conference on Mechatronics and Automation.

[126]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[127]  Hong Zhou,et al.  The hybrid heuristic genetic algorithm for job shop scheduling , 2001 .

[128]  Chandrasekharan Rajendran,et al.  A simulated annealing heuristic for scheduling in a flowshop with bicriteria , 1994 .

[129]  Joseph B. Mazzola,et al.  Flow Shop Scheduling with Resource Flexibility , 1994, Oper. Res..

[130]  Daniel Sipper,et al.  Production: Planning, Control and Integration , 1997 .

[131]  Vassilios S. Vassiliadis,et al.  A novel threshold accepting meta-heuristic for the job-shop scheduling problem , 2004, Comput. Oper. Res..

[132]  Saeed Zolfaghari,et al.  A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling , 2007, Eur. J. Oper. Res..

[133]  Hiroaki Ishii,et al.  The mixed shop scheduling problem , 1985, Discret. Appl. Math..

[134]  Christian Prins,et al.  Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..

[135]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

[136]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[137]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[138]  Bostjan Murovec,et al.  A repairing technique for the local search of the job-shop problem , 2004, Eur. J. Oper. Res..

[139]  W. Vent,et al.  Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

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

[141]  Maristela Oliveira dos Santos,et al.  An adaptive hybrid metaheuristic for permutation flowshop scheduling , 2000 .

[142]  Wojciech Bozejko,et al.  Solving the Flow Shop Problem by Parallel Simulated Annealing , 2001, PPAM.

[143]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[144]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

[145]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[146]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[147]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

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

[149]  Ravi Shankar,et al.  A neuro-tabu search heuristic for the flow shop scheduling problem , 2004, Comput. Oper. Res..

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

[151]  Ching-Fang Liaw,et al.  An iterative improvement approach for the nonpreemptive open shop scheduling problem , 1998, Eur. J. Oper. Res..

[152]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

[153]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[154]  Christos D. Tarantilis,et al.  A hybrid evolutionary algorithm for the job shop scheduling problem , 2009, J. Oper. Res. Soc..

[155]  Yoshiyasu Takefuji,et al.  Integer linear programming neural networks for job-shop scheduling , 1988, IEEE 1988 International Conference on Neural Networks.

[156]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[157]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[158]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[159]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

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

[161]  Vladimir Cherkassky,et al.  A neural network approach to job-shop scheduling , 1991, IEEE Trans. Neural Networks.

[162]  Li Lin,et al.  Effective job shop scheduling through active chain manipulation , 1995, Comput. Oper. Res..

[163]  Ching-Fang Liaw,et al.  A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..

[164]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

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

[166]  Wallace J. Hopp,et al.  Factory physics : foundations of manufacturing management , 1996 .

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

[168]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

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

[170]  C. D. Tarantilis,et al.  A list-based threshold accepting method for job shop scheduling problems , 2002 .

[171]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..