A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem

Abstract The blocking flow-shop scheduling problem (BFSP) has been aroused general attention due to its broad industrial applications. However, most researches about it mainly focus on optimization of single objective. Multiple objectives are less considered simultaneously. Actually, in the practical production, the consideration of multiple objectives simultaneously could give more realistic solutions to the decision maker. Therefore, in this paper, we propose a novel multi-objective discrete water wave optimization (MODWWO) algorithm to solve a multi-objective BFSP (MOBFSP) that minimizes both makespan and total flow time. In the proposed algorithm, a decomposition-based initialization strategy is developed to generate a population with high quality and diversity. Then, a ranking-based propagation operator is designed to guide the global exploration and local exploitation of algorithm. Afterwards, a local intensification-based breaking operator is applied to improve the quality of the new created waves. Furthermore, a problem-specific refraction operator is incorporated to avoid being trapped in local optimum. The proposed algorithm is evaluated based on the benchmark instances, and compared with several state-of-the-art multi-objective scheduling optimization approaches. The comparison results show that the proposed MODWWO is a high-performing method for the considered MOBFSP.

[1]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[2]  Cheng Wang,et al.  A three-phase algorithm for flowshop scheduling with blocking to minimize makespan , 2012, Comput. Oper. Res..

[3]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

[4]  Rong-Qiang Zeng,et al.  Solving bi-objective flow shop problem with hybrid path relinking algorithm , 2013, Appl. Soft Comput..

[5]  Talel Ladhari,et al.  Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking , 2018, Ann. Oper. Res..

[6]  Yuyan Han,et al.  Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions , 2018 .

[7]  S. Holm A Simple Sequentially Rejective Multiple Test Procedure , 1979 .

[8]  Kay Chen Tan,et al.  A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[9]  Xiao-Yan Sun,et al.  A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking , 2015 .

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

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

[12]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[13]  Rubén Ruiz,et al.  Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems , 2011, Comput. Oper. Res..

[14]  Xavier Tort-Martorell,et al.  An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization , 2015, Expert Syst. Appl..

[15]  Xavier Tort-Martorell,et al.  Efficient heuristics for the parallel blocking flow shop scheduling problem , 2017, Expert Syst. Appl..

[16]  Shih-Wei Lin,et al.  Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm , 2013 .

[17]  Jing J. Liang,et al.  Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem , 2013 .

[18]  Victor Fernandez-Viagas,et al.  A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation , 2017, Eur. J. Oper. Res..

[19]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

[20]  Chin-Chia Wu,et al.  An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times , 2017, Appl. Soft Comput..

[21]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[22]  Imma Ribas,et al.  A competitive variable neighbourhood search algorithm for the blocking flow shop problem , 2013 .

[23]  Cheng Wu,et al.  New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm , 2016 .

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

[25]  Yujun Zheng Water wave optimization: A new nature-inspired metaheuristic , 2015, Comput. Oper. Res..

[26]  Robert M. Haralick,et al.  Feature normalization and likelihood-based similarity measures for image retrieval , 2001, Pattern Recognit. Lett..

[27]  Quan-Ke Pan,et al.  An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem , 2014 .

[28]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[29]  Xianpeng Wang,et al.  A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking , 2012, Appl. Soft Comput..

[30]  Ling Wang,et al.  Effective heuristics for the blocking flowshop scheduling problem with makespan minimization , 2012 .

[31]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[32]  Yujun Zheng,et al.  A simplified water wave optimization algorithm , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[33]  Ceyda Oguz,et al.  A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine , 2012, Comput. Oper. Res..

[34]  Xiangtao Li,et al.  Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times , 2017, IEEE Transactions on Engineering Management.

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

[36]  Dechang Pi,et al.  Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness , 2017, Comput. Ind. Eng..

[37]  Yaochu Jin,et al.  Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns , 2019, IEEE Transactions on Cybernetics.

[38]  Pengfei Wang,et al.  An Improved Biogeography-Based Optimization Algorithm for Blocking Flow Shop Scheduling Problem , 2018 .

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

[40]  Dechang Pi,et al.  Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem , 2017 .

[41]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[42]  Yi Zhang,et al.  A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem , 2018, Expert Syst. Appl..

[43]  Ahmad Azadi Hematabadi,et al.  Optimizing the multi-objective bidding strategy using min-max technique and modified water wave optimization method , 2019, Neural Comput. Appl..

[44]  Dechang Pi,et al.  A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times , 2017, Swarm Evol. Comput..

[45]  Imma Ribas,et al.  Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization , 2015, Comput. Ind. Eng..

[46]  Zhi Yang,et al.  A hybrid multi-objective gray wolf optimization algorithm for a fuzzy blocking flow shop scheduling problem , 2018 .

[47]  Li-Chen Fu,et al.  NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems , 2011, Expert Syst. Appl..

[48]  Xavier Tort-Martorell,et al.  An efficient iterated local search algorithm for the total tardiness blocking flow shop problem , 2013 .

[49]  Quan-Ke Pan,et al.  Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm , 2017 .

[50]  Quan-Ke Pan,et al.  Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time , 2016, Appl. Soft Comput..

[51]  Shih-Wei Lin,et al.  Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm , 2013, Comput. Oper. Res..

[52]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..

[53]  Liang Gao,et al.  Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times , 2017, Appl. Math. Comput..

[54]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[55]  Zhang Shuning,et al.  A discrete group search optimizer for blocking flow shop multi-objective scheduling , 2016 .

[56]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[57]  Yazid Mati,et al.  Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..

[58]  Marcelo Seido Nagano,et al.  A new evolutionary clustering search for a no-wait flow shop problem with set-up times , 2012, Eng. Appl. Artif. Intell..

[59]  Francisco Herrera,et al.  A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability , 2009, Soft Comput..

[60]  Quan-Ke Pan,et al.  A Hybrid Fruit Fly Optimization Algorithm for the Realistic Hybrid Flowshop Rescheduling Problem in Steelmaking Systems , 2016, IEEE Transactions on Automation Science and Engineering.

[61]  Abdul Sattar,et al.  Scatter search for mixed blocking flowshop scheduling , 2017, Expert Syst. Appl..

[62]  Chen-Yang Cheng,et al.  Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities , 2018, Comput. Ind. Eng..

[63]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

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

[65]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[66]  Victor Fernandez-Viagas,et al.  A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime , 2016, Expert Syst. Appl..

[67]  Khaled Ghédira,et al.  A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion , 2017, Comput. Ind. Eng..

[68]  Yaochu Jin,et al.  A competitive mechanism based multi-objective particle swarm optimizer with fast convergence , 2018, Inf. Sci..

[69]  Rubén Ruiz,et al.  Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study , 2013, Eur. J. Oper. Res..

[70]  D. Gong,et al.  Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm , 2016 .

[71]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[72]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the total tardiness blocking flow shop problem , 2017, Journal of Intelligent Manufacturing.

[73]  Hisao Ishibuchi,et al.  Reference point specification in hypervolume calculation for fair comparison and efficient search , 2017, GECCO.

[74]  Xingsheng Gu,et al.  A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling , 2012 .

[75]  Mehmet Fatih Tasgetiren,et al.  Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion , 2017, Comput. Oper. Res..