A Cooperative Algorithm for Energy-efficient Scheduling of Distributed No-wait Flowshop

This paper addresses an energy-efficient distributed no-wait flowshop scheduling problem (EEDNFSP) with the criteria of minimizing both the makespan and the total energy consumption. A cooperative algorithm is proposed to solve the EEDNFSP. First, a cooperative initialization method which hybridizes the modified Nawaz-Enscore-Ham (NEH) heuristic and random initialization is presented to generate good and diverse initial solutions. Second, based on the characteristics of such a bi-objective scheduling problem, three types of search operators are developed for three sub-problems, i.e., factory assignment, job sequence, and speed selection. Third, a cooperation mechanism for the search operators is designed to trade-off two criteria. Fourth, a local intensification component is used for exploiting better non-dominated solutions sufficiently. Moreover, an energy saving method is utilized to further improve the quality of the explored solutions. The effect of parameter setting on the cooperative algorithm is investigated by using the Taguchi method of design-of-experiment. Computational tests and comparisons are carried out, which verify the effectiveness of the proposed algorithm in solving the EEDNFSP.

[1]  J. Framiñan,et al.  A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem , 2015 .

[2]  Ling Wang,et al.  A Competitive Memetic Algorithm for Carbon-Efficient Scheduling of Distributed Flow-Shop , 2016, ICIC.

[3]  Xiaoping Li,et al.  Heuristic for no-wait flow shops with makespan minimization , 2008, ICIT 2008.

[4]  Cheng Wu,et al.  Carbon-efficient scheduling of flow shops by multi-objective optimization , 2016, Eur. J. Oper. Res..

[5]  Rubén Ruiz,et al.  The distributed permutation flowshop scheduling problem , 2010, Comput. Oper. Res..

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

[7]  Mehmet Bayram Yildirim,et al.  A framework to minimise total energy consumption and total tardiness on a single machine , 2008 .

[8]  Adriana Giret,et al.  Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm , 2013 .

[9]  Ling Wang,et al.  An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem , 2014 .

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

[11]  John W. Sutherland,et al.  Flow shop scheduling with peak power consumption constraints , 2013, Ann. Oper. Res..

[12]  Shengyao Wang,et al.  A competitive memetic algorithm for the distributed flow shop scheduling problem , 2014, 2014 IEEE International Conference on Automation Science and Engineering (CASE).

[13]  Rong Chen,et al.  A Knowledge-based Genetic Algorithm for Permutation Flowshop Scheduling Problems with Multiple Factories , 2012 .

[14]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[15]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[16]  Rong Chen,et al.  An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems , 2011 .

[17]  John W. Sutherland,et al.  A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction , 2011 .

[18]  Ling Wang,et al.  An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem , 2013 .

[19]  Shih-Wei Lin,et al.  Minimizing makespan for solving the distributed no-wait flowshop scheduling problem , 2016, Comput. Ind. Eng..

[20]  Raymond Chiong,et al.  Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption , 2016 .

[21]  Ihsan Sabuncuoglu,et al.  Distributed scheduling: a review of concepts and applications , 2010 .

[22]  G. M. Komaki,et al.  General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem , 2017, Prod. Eng..

[23]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[24]  Marcelo Seido Nagano,et al.  Evaluating the performance for makespan minimisation in no-wait flowshop sequencing , 2008 .

[25]  Mehmet Mutlu Yenisey,et al.  Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .

[26]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[27]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[28]  Rubén Ruiz,et al.  A scatter search algorithm for the distributed permutation flowshop scheduling problem , 2014, Eur. J. Oper. Res..

[29]  Debarshi Barat,et al.  Job Scheduling with Genetic Algorithm , 2013 .

[30]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[31]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.