Metaheuristics for Scheduling in Industrial and Manufacturing Applications

This volume presents meta-heuristics approaches for scheduling problems arising in industrial and manufacturing applications. Nowadays, metaheuristics have become a de facto approach to tackle in practice with the complexity of scheduling problems. Early work applied evolutionary computing methods to scheduling problems. The present volume is novel in many respects. First, the proposed approaches comprise a variety of meta-heuristics (Genetic Algorithms, Memetic Algorithms, Ant Colony Optimization, Particle Swarm Optimization, Tabu Search, Scatter Search, Variable Neighborhood Search). Second, in most cases, hybridization is approached as the most effective way to achieve state-of-the art results. Third, and most importantly, the scheduling problems arising in real life applications and real world data instances are solved using these meta-heuristics; these applications comprise reconfigurable manufacturing systems, lot sizing and scheduling in industry, railway scheduling and process, supply chain scheduling and scheduling problem arising in a real-world multi-commodity Oil-derivatives Pipeline. Finally, scheduling problems and meta-heuristics are presented in a comprehensive way making this volume and interesting contribution to the research on scheduling in industrial and manufacturing applications.

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

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

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

[4]  K. Preston White,et al.  A recent survey of production scheduling , 1988, IEEE Trans. Syst. Man Cybern..

[5]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[6]  Hans Kellerer,et al.  Thek-partitioning problem , 1998, Math. Methods Oper. Res..

[7]  Peter Ross,et al.  Evolutionary Scheduling: A Review , 2005, Genetic Programming and Evolvable Machines.

[8]  F. Glover,et al.  Scatter Search and Path Relinking: Foundations and Advanced Designs , 2004 .

[9]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[10]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[11]  Maria Grazia Scutellà,et al.  A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

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

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

[14]  Celso C. Ribeiro,et al.  A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling , 2004, WEA.

[15]  Michel Gendreau,et al.  A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective , 1994, Comput. Oper. Res..

[16]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[17]  Ethel Mokotoff,et al.  Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .

[18]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[19]  Margaret L. Brandeau,et al.  Optimal Component Assignment and Board Grouping in Printed Circuit Board Manufacturing , 1998, Oper. Res..

[20]  Bo Chen,et al.  Parallel Scheduling for Early Completion , 2004, Handbook of Scheduling.

[21]  Mauro Dell'Amico,et al.  Lower bounds and heuristic algorithms for the k , 2006, Eur. J. Oper. Res..

[22]  Mauro Dell'Amico,et al.  Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem , 2004, J. Heuristics.

[23]  Michel Baudin Manufacturing systems analysis : with application to production scheduling , 1990 .

[24]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[25]  G. S. Lueker,et al.  Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics , 1988 .

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

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

[28]  S. Martello,et al.  Bounds for the cardinality constrained P∥Cmax problem , 2001 .

[29]  Mauro Dell'Amico,et al.  Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem , 2008, INFORMS J. Comput..

[30]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[31]  Mauro Dell'Amico,et al.  A note on exact algorithms for the identical parallel machine scheduling problem , 2005, Eur. J. Oper. Res..

[32]  Mauro Dell'Amico,et al.  Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

[33]  Mohamed Haouari,et al.  Tight bounds for the identical parallel machine scheduling problem , 2006, Int. Trans. Oper. Res..

[34]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .

[35]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.