Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns

In various flow shop scheduling problems, it is very common that a machine suffers from breakdowns. Under this situation, a robust and stable suboptimal scheduling solution is of more practical interest than a global optimal solution that is sensitive to environmental changes. However, blocking lot-streaming flow shop (BLSFS) scheduling problems with machine breakdowns have not yet been well studied up to date. This paper presents, for the first time, a multiobjective model of the above problem including robustness and stability criteria. Based on this model, an evolutionary multiobjective robust scheduling algorithm is suggested, in which solutions obtained by a variant of single-objective heuristic are incorporated into population initialization and two novel crossover operators are proposed to take advantage of nondominated solutions. In addition, a rescheduling strategy based on the local search is presented to further reduce the negative influence resulted from machine breakdowns.The proposed algorithm is applied to 22 test sets, and compared with the state-of-the-art algorithms without machine breakdowns. Our empirical results demonstrate that the proposed algorithm can effectively tackle BLSFS scheduling problems in the presence of machine breakdowns by obtaining scheduling strategies that are robust and stable.

[1]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[2]  Quan-Ke Pan,et al.  An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process , 2013, IEEE Transactions on Automation Science and Engineering.

[3]  Xiangtao Li,et al.  Multi-Objective Memetic Search Algorithm for Multi-Objective Permutation Flow Shop Scheduling Problem , 2016, IEEE Access.

[4]  Donya Rahmani,et al.  Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times , 2014 .

[5]  DebK.,et al.  A fast and elitist multiobjective genetic algorithm , 2002 .

[6]  Cheng-Hsiang Liu,et al.  Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms , 2014 .

[7]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[8]  Axel Tuma,et al.  Energy-efficient scheduling in manufacturing companies: A review and research framework , 2016, Eur. J. Oper. Res..

[9]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

[10]  M. Gholami,et al.  Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[11]  Jose M. Framiñan,et al.  New hard benchmark for flowshop scheduling problems minimising makespan , 2015, Eur. J. Oper. Res..

[12]  D. Gong,et al.  An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem , 2014 .

[13]  Kai Wang,et al.  A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown , 2016, J. Oper. Res. Soc..

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

[15]  Frank Werner,et al.  Measures of problem uncertainty for scheduling with interval processing times , 2013, OR Spectr..

[16]  Mikkel T. Jensen,et al.  Generating robust and flexible job shop schedules using genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[17]  P. Chang,et al.  A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem , 2015 .

[18]  Xianpeng Wang,et al.  A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem , 2017, Comput. Oper. Res..

[19]  Kanchana Sethanan,et al.  A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry , 2016, Eur. J. Oper. Res..

[20]  Rubén Ruiz,et al.  Flow shop rescheduling under different types of disruption , 2013 .

[21]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[22]  Wei-Chang Yeh,et al.  Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects , 2014, Inf. Sci..

[23]  Ihsan Sabuncuoglu,et al.  Robustness and stability measures for scheduling: single-machine environment , 2008 .

[24]  Yugeng Xi,et al.  Robust and stable scheduling of a single machine with random machine breakdowns , 2006 .

[25]  Min Liu,et al.  A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With Blocking , 2013, IEEE Transactions on Automation Science and Engineering.

[26]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

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

[28]  W. J. Chen,et al.  Scheduling under machine breakdown in a continuous process industry , 2004, Comput. Oper. Res..

[29]  Taïcir Loukil,et al.  A genetic algorithm for robust hybrid flow shop scheduling , 2011, Int. J. Comput. Integr. Manuf..

[30]  S. H. Choi,et al.  A holonic approach to flexible flow shop scheduling under stochastic processing times , 2014, Comput. Oper. Res..

[31]  Jose A. Ventura,et al.  An application of genetic algorithms to lot-streaming flow shop scheduling , 2002 .

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

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

[34]  Yaochu Jin,et al.  A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy , 2017, IEEE Transactions on Cybernetics.

[35]  Kai Wang,et al.  A decomposition-based approach to flexible flow shop scheduling under machine breakdown , 2012 .

[36]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..