Outline of Scheduling

At the first, the present chapter overviews the framework of a wide variety of scheduling methods, and thereby we can expect to become able to grasp the trends and perspectives in the researches on scheduling. Secondly, we observe the classification of models related to scheduling decisions. The well known classification may be deterministic scheduling versus stochastic scheduling, or static scheduling versus dynamic scheduling. In addition, we also consider a classification by online scheduling versus offline scheduling to clarify how we can discuss the online scheduling within the framework of scheduling problems. Finally, we summarize various scheduling models based on the famous triplet \(\alpha |\beta |\gamma \), i.e. manufacturing environments(\(\alpha \)), restrictions and constraints (\(\beta \)), and the performance measures (\(\gamma \)).

[1]  Ching-Fang Liaw,et al.  Applying simulated annealing to the open shop scheduling problem , 1999 .

[2]  Vidyaranya B. Gargeya,et al.  Scheduling in the dynamic job shop under auxiliary resource constraints: A simulation study , 1999 .

[3]  Anita Lee,et al.  TOWARDS A KNOWLEDGE-BASED SCHEDULING SYSTEM FOR SEMICONDUCTOR TESTING , 1998 .

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

[5]  B. Adenso-Díaz.  Restricted neighborhood in the tabu search for the flowshop problem , 1992 .

[6]  K. Preston White,et al.  PERIODIC FLOW LINE SCHEDULING , 1998 .

[7]  Michael Pinedo,et al.  Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints , 1984 .

[8]  Jorge Pinho de Sousa,et al.  Metaheuristics: Computer Decision-Making , 2010 .

[9]  Jens Clausen,et al.  Parallel branch-and-bound methods for thejob-shop scheduling problem , 1998, Ann. Oper. Res..

[10]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[11]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[12]  M. Liang,et al.  An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups , 1998, Eur. J. Oper. Res..

[13]  Christos Koulamas,et al.  Scheduling on uniform parallel machines to minimize maximum lateness , 2000, Oper. Res. Lett..

[14]  Ruyan Fu,et al.  The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan , 2008 .

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

[16]  Anil K. Jain,et al.  PRODUCTION SCHEDULING/RESCHEDULING IN FLEXIBLE MANUFACTURING , 1997 .

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

[18]  Prabuddha De,et al.  On the minimization of the weighted number of tardy jobs with random processing times and deadline , 1991, Comput. Oper. Res..

[19]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[20]  Yves Robert,et al.  Introduction to Scheduling , 2009, CRC computational science series.

[21]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[22]  Stanley B. Gershwin,et al.  An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking , 1987, Oper. Res..

[23]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[24]  Ron Shamir,et al.  An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem , 1989, Inf. Process. Lett..

[25]  Leah Epstein,et al.  Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data , 2005, Inf. Comput..

[26]  Michael Pinedo,et al.  Heuristics for minimizing total weighted tardiness in flexible flow shops , 2000 .

[27]  S. B. Joshi,et al.  Job-shop scheduling - using component packing and simulated annealing approach , 1999 .

[28]  Christos Koulamas,et al.  A note on weighted completion time minimization in a flexible flow shop , 2001, Oper. Res. Lett..

[29]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective , 2003 .

[30]  Joseph Y.-T. Leung.  Introduction and Notation , 2004, Handbook of Scheduling.

[31]  M. Caramanis,et al.  Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems , 1998 .

[32]  George L. Vairaktarakis,et al.  The use of flowlines to simplify routing complexity in two-stage flowshops , 2000 .

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

[34]  M. A. B. Candido,et al.  A genetic algorithm based procedure for more realistic job shop scheduling problems , 1998 .

[35]  Rongheng Li,et al.  Improved algorithm for a generalized on-line scheduling problem on identical machines , 2007, Eur. J. Oper. Res..

[36]  Yeong-Dae Kim,et al.  A decomposition approach to a multi-period vehicle scheduling problem , 1999 .

[37]  Jatinder N. D. Gupta,et al.  Minimizing tardy jobs in a flowshop with common due date , 2000, Eur. J. Oper. Res..

[38]  Hiroshi Ohta,et al.  A heuristic for job shop scheduling to minimize total weighted tardiness , 2002 .

[39]  Vcs Vincent Wiers,et al.  A review of the applicability of OR and AI scheduling techniques in practice , 1997 .

[40]  Yossi Azar,et al.  Ancient and New Algorithms for Load Balancing in the lp Norm , 1998, SODA '98.

[41]  Narendra Jussien,et al.  Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems , 1998, Eur. J. Oper. Res..

[42]  J. Christopher Beck,et al.  A global constraint for total weighted completion time for cumulative resources , 2008, Eng. Appl. Artif. Intell..

[43]  J.M. Schopf,et al.  Stochastic Scheduling , 1999, ACM/IEEE SC 1999 Conference (SC'99).

[44]  Ruyan Fu,et al.  A best online algorithm for scheduling on two parallel batch machines , 2009, Theor. Comput. Sci..

[45]  M. Duran Toksari,et al.  A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs , 2011, Comput. Oper. Res..

[46]  Chengbin Chu,et al.  A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness , 2007, Eur. J. Oper. Res..

[47]  Reha Uzsoy,et al.  Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..

[48]  Tohru Watanabe,et al.  On-line scheduling for adaptive control machine tools in FMS , 1985 .

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

[50]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[51]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[52]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[53]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

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

[55]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[56]  Pius J. Egbelu,et al.  SCHEDULING IN A PRODUCTION ENVIRONMENT WITH MULTIPLE PROCESS PLANS PER JOB , 1999 .

[57]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

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

[59]  M. Selim Akturk,et al.  Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness , 2011, Comput. Oper. Res..

[60]  Csanád Imreh,et al.  Online scheduling with general machine cost functions , 2009, Discret. Appl. Math..

[61]  Gerhard J. Woeginger,et al.  Competitive Analysis of Algorithms , 1996, Online Algorithms.

[62]  Elizabeth Szelke,et al.  Artificial Intelligence in Reactive Scheduling , 1995, IFIP Advances in Information and Communication Technology.

[63]  Christos Koulamas,et al.  Flexible flow shop scheduling with uniform parallel machines , 2006, Eur. J. Oper. Res..

[64]  Jonathan F. Bard,et al.  A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times , 1999 .

[65]  Maged M. Dessouky,et al.  Flowshop scheduling with identical jobs and uniform parallel machines , 1998, Eur. J. Oper. Res..

[66]  S.-C. Huang,et al.  An interactive scheduler for a wafer probe centre in semiconductor manufacturing , 1998 .

[67]  Jonathan F. Bard,et al.  A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..

[68]  M. Selim Akturk,et al.  Match-up scheduling under a machine breakdown , 1999, Eur. J. Oper. Res..

[69]  Massimo Paolucci,et al.  A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2009, Eur. J. Oper. Res..

[70]  V. V. S. Sarma,et al.  Knowledge-Based Approaches to Scheduling Problems: A Survey , 1991, IEEE Trans. Knowl. Data Eng..

[71]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[72]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

[73]  Jeffrey E. Schaller,et al.  A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell , 2000 .

[74]  Tapan P. Bagchi,et al.  Multiobjective Scheduling by Genetic Algorithms , 1999 .

[75]  Mohamed Ben-Daya,et al.  FMS short term planning problems: a review , 1995 .

[76]  Christos Koulamas,et al.  A note on makespan minimization in two-stage flexible flow shops with uniform machines , 2006, Eur. J. Oper. Res..

[77]  Chak-Kuen Wong,et al.  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..

[78]  Guochuan Zhang,et al.  A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer , 1997, Inf. Process. Lett..

[79]  N. Piersma,et al.  A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search , 1996 .

[80]  Reza Tavakkoli-Moghaddam,et al.  A computer simulation model for job shop scheduling problems minimizing makespan , 2005, Comput. Ind. Eng..

[81]  edited by Jospeh Y-T. Leung,et al.  Handbook of scheduling , 2013 .

[82]  Ye Tao,et al.  An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time , 2010, Inf. Process. Lett..

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

[84]  Yves Dallery,et al.  An improved decomposition method for the analysis of production lines with unreliable machines and finite buffers , 1999 .

[85]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[86]  George L. Vairaktarakis,et al.  Performance Comparison of Some Classes of Flexible Flow Shops and Job Shops , 1998 .

[87]  Chung-Hsing Yeh,et al.  Job oriented production scheduling , 1990 .

[88]  Meral Azizoglu,et al.  On the minimization of total weighted flow time with identical and uniform parallel machines , 1999, Eur. J. Oper. Res..

[89]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[90]  M. Sacramento Quintanilla,et al.  A tabu search approach to machine scheduling , 1998, Eur. J. Oper. Res..

[91]  Yeong-Dae Kim,et al.  A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints , 2000, Eur. J. Oper. Res..

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

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

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

[95]  Yeong-Dae Kim,et al.  A real-time scheduling mechanism for a flexible manufacturing system: Using simulation and dispatching rules , 1998 .

[96]  Peter Brucker,et al.  Complex Scheduling , 2006 .

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

[98]  Reha Uzsoy,et al.  A review of production planning and scheduling models in the semiconductor industry , 1994 .

[99]  Kripa Shanker,et al.  A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment , 1999, Eur. J. Oper. Res..

[100]  Reha Uzsoy,et al.  Performance of decomposition procedures for job shop scheduling problems with bottleneck machines , 2000 .

[101]  G. Steiner,et al.  Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging , 1996 .

[102]  Yuanhui Zhang,et al.  Mixed-model assembly line scheduling using the Lagrangian relaxation technique , 2000 .

[103]  Reha Uzsoy,et al.  Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..

[104]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[105]  J. George Shanthikumar,et al.  Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number , 1983, Comput. Oper. Res..

[106]  Wieslaw Kubiak,et al.  Total completion time minimization in two-machine job shops with unit-time operations , 1996 .

[107]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[108]  John W. Fowler,et al.  Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems , 2011, Comput. Oper. Res..

[109]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

[110]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[111]  Mohamed F. Hassan,et al.  A hybrid GA/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles , 2004 .

[112]  Paolo Brandimarte.  Exploiting process plan flexibility in production scheduling: A multi-objective approach , 1999, Eur. J. Oper. Res..

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

[114]  Alireza Fallahi,et al.  Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability , 2010 .

[115]  Krishna R. Pattipati,et al.  Schedule generation and reconfiguration for parallel machines , 1990, IEEE Trans. Robotics Autom..

[116]  Shi-Jinn Horng,et al.  An efficient job-shop scheduling algorithm based on particle swarm optimization , 2010, Expert Syst. Appl..

[117]  Andrea Rossi,et al.  Dynamic scheduling of FMS using a real-time genetic algorithm , 2000 .

[118]  Rakesh Nagi,et al.  Integrated scheduling of material handling and manufacturing activities for just-in-time production of complex assemblies , 1998 .

[119]  Monaldo Mastrolilli,et al.  On-line scheduling to minimize max flow time: an optimal preemptive algorithm , 2005, Oper. Res. Lett..

[120]  Ihsan Sabuncuoglu,et al.  An analysis of heuristics in a dynamic job shop with weighted tardiness objectives , 1999 .

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

[122]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[123]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[124]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[125]  M.I.M. Wahab,et al.  A dynamic approach to measure machine and routing flexibilities of manufacturing systems , 2008 .

[126]  Ihsan Sabuncuoglu,et al.  A STUDY OF SCHEDULING RULES OF FLEXIBLE MANUFACTURING SYSTEMS : A SIMULATION APPROACH , 1998 .

[127]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[128]  Der-Chiang Li,et al.  A strategy for evolution of alhorithms to increase the computational effectiveness of NP-hard scheduling problems , 1996 .

[129]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[130]  Yong He,et al.  Semi-online scheduling problems on two identical machines with inexact partial information , 2007, Theor. Comput. Sci..

[131]  Michel Gendreau,et al.  The hot strip mill production scheduling problem: A tabu search approach , 1998, Eur. J. Oper. Res..

[132]  Jeffrey S. Smith,et al.  Job shop scheduling considering material handling , 1999 .

[133]  C. Rajendran.  Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers , 1999 .

[134]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[135]  Zhaohui Liu,et al.  Online scheduling with reassignment on two uniform machines , 2010, Theor. Comput. Sci..

[136]  Henri Pierreval,et al.  Manufacturing cell design with flexible routings capability in presence of unreliable machines , 1999 .

[137]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[138]  Derek L. Nazareth,et al.  Intelligent decision support for flexible manufacturing: Design and implementation of a knowledge-based simulator , 1996 .

[139]  Jiyin Liu,et al.  General heuristic procedures and solution strategies for FMS scheduling , 1999 .

[140]  Yih-Bor Wu,et al.  Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm , 1987 .

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

[142]  Yong He,et al.  Semi-online scheduling jobs with tightly-grouped processing times on three identical machines , 2005, Discret. Appl. Math..

[143]  Mostafa Zandieh,et al.  Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization , 2009, Comput. Ind. Eng..

[144]  Karin Krüger,et al.  Heuristics for generalized shop scheduling problems based on decomposition , 1998 .

[145]  Donglei Du,et al.  Optimal preemptive semi-online scheduling on two uniform processors , 2004, Inf. Process. Lett..

[146]  Jonathan F. Bard,et al.  A GRASP for scheduling printed wiring board assembly , 1996 .

[147]  Andrea Rossi,et al.  Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method , 2007 .

[148]  Yong He,et al.  Semi-on-line scheduling with ordinal data on two uniform machines , 2001, Oper. Res. Lett..