Robust and stable scheduling of a single machine with random machine breakdowns

For single-machine scheduling with random machine breakdowns, a new method considering both robustness and stability is proposed in this paper. The stability of the predictive schedule is measured by the sum of the absolute deviations between the planned job completion times and the realized ones. A surrogate measure is developed to evaluate the stability, assuming that there is only one breakdown. Generating a robust and stable schedule becomes a bi-objective optimization problem. A two-stage multi-population genetic algorithm is proposed to solve the bi-objective optimization problem. The method is applied to minimizing the total weighted tardiness of all jobs. The computational results show that the schedule generated by the proposed method is insensitive to disturbances, along with providing better robustness and stability.

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

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

[3]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[4]  GenMitsuo,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II , 1996 .

[5]  David Alcaide López de Pablo,et al.  An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns , 2002, Eur. J. Oper. Res..

[6]  Hajime Kita,et al.  Multi-objective optimization by genetic algorithms: a review , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[8]  Thomas Bäck,et al.  Selective Pressure in Evolutionary Algorithms: A Characterization of Selection Mechanisms , 1994, International Conference on Evolutionary Computation.

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

[10]  Jeffrey Horn,et al.  Multicriterion decision making , 1997 .

[11]  Thomas E. Morton,et al.  Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[12]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[13]  P. Pardalos Complexity in numerical optimization , 1993 .

[14]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[15]  George L. Vairaktarakis,et al.  Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .

[16]  Sanjay Mehta,et al.  Predictable scheduling of a single machine subject to breakdowns , 1999, Int. J. Comput. Integr. Manuf..

[17]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

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

[19]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[20]  Lotfi A. Zadeh,et al.  Optimality and non-scalar-valued performance criteria , 1963 .

[21]  Reha Uzsoy,et al.  Predictable scheduling of a single machine with breakdowns and sensitive jobs , 1999 .

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

[23]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[24]  J. A. Svestka,et al.  Rescheduling job shops under random disruptions , 1997 .

[25]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

[26]  L. P. Khoo,et al.  A Prototype Genetic Algorithm-Enhanced Multi-Objective Scheduler for Manufacturing Systems , 2000 .

[27]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

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

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

[30]  John W. Fowler,et al.  A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..

[31]  Chung Yee Lee,et al.  A Classification of Static Scheduling Problems , 1993 .

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

[33]  Qiang Liu,et al.  A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem , 1999, J. Heuristics.

[34]  Ihsan Sabuncuoglu,et al.  Rescheduling frequency in an FMS with uncertain processing times and unreliable machines , 1999 .

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

[36]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .