Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness

Abstract This paper proposes a self-adaptive discrete invasive weed optimization (SaDIWO) to solve the blocking flow-shop scheduling problem (BFSP) with the objective of minimizing total tardiness which has important applications in a variety of industrial systems. In the proposed SaDIWO, an improved NEH-based heuristic is firstly presented to generate an initial solution with high quality. Then, to guide the global exploration and local exploitation, a self-adaptive insertion-based spatial dispersal is presented. A distance-based competitive exclusion is developed to strike a compromise between the quality and diversity of offspring population. A variable neighborhood search with a speed-up mechanism is embedded to further enhance exploitation in the promising region around the individuals. Afterward, the parameters setting and the effectiveness of each component of the proposed algorithm are investigated through numerical experiments. The performance of the proposed algorithm is evaluated by comparisons with the existing state-of-the-art algorithms in the literature. Experimental results show that the proposed algorithm outperforms the existing state-of-the-art algorithms. Furthermore, the proposed SaDIWO also improves the best known solutions for 132 out of 480 problem instances.

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

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

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

[4]  Swagatam Das,et al.  Design of Non-Uniform Circular Antenna Arrays Using a Modified Invasive Weed Optimization Algorithm , 2011, IEEE Transactions on Antennas and Propagation.

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

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

[7]  Yoram Koren,et al.  Value creation through design for scalability of reconfigurable manufacturing systems , 2017, Int. J. Prod. Res..

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

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

[10]  Yeong-Dae Kim,et al.  Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .

[11]  Quan-Ke Pan,et al.  An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems , 2018, J. Intell. Manuf..

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

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

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

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

[16]  Quan-Ke Pan,et al.  Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows , 2017, Comput. Oper. Res..

[17]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[18]  Bassem Jarboui,et al.  Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem , 2016, J. Comput. Des. Eng..

[19]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[20]  T. Velmurugan,et al.  Seamless Vertical Handoff using Invasive Weed Optimization (IWO) algorithm for heterogeneous wireless networks , 2016 .

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

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

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

[24]  Victor Fernandez-Viagas,et al.  NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness , 2015, Comput. Oper. Res..

[25]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[26]  T. Jayabarathi,et al.  Optimal placement and sizing of multiple distributed generating units in distribution networks by invasive weed optimization algorithm , 2016 .

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

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

[29]  Caro Lucas,et al.  A novel numerical optimization algorithm inspired from weed colonization , 2006, Ecol. Informatics.

[30]  Ling Wang,et al.  Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer , 2011 .

[31]  Jan Adamowski,et al.  Optimal groundwater remediation design of pump and treat systems via a simulation–optimization approach and firefly algorithm , 2015 .

[32]  D. Davendra,et al.  Scheduling flow shops with blocking using a discrete self-organising migrating algorithm , 2013 .

[33]  Liang Gao,et al.  An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming , 2017, Appl. Soft Comput..

[34]  Christos T. Maravelias,et al.  Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models , 2016, Comput. Chem. Eng..

[35]  Camino R. Vela,et al.  An efficient memetic algorithm for total weighted tardiness minimization in a single machine with setups , 2015, Appl. Soft Comput..

[36]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[37]  José Elias Claudio Arroyo,et al.  Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking , 2008, NICSO.

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

[39]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

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

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

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

[43]  Quan-Ke Pan,et al.  An improved artificial bee colony algorithm for the blocking flowshop scheduling problem , 2012 .

[44]  Korhan Karabulut,et al.  A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops , 2016, Comput. Ind. Eng..

[45]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[46]  John M. Wilson,et al.  Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops , 2010, Comput. Ind. Eng..

[47]  Dragan Vasiljevic,et al.  Handling ties in heuristics for the permutation flow shop scheduling problem , 2015 .

[48]  Mehmet Fatih Tasgetiren,et al.  A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion , 2016, Algorithms.

[49]  Ajit Kumar Barisal,et al.  Large scale economic dispatch of power systems using oppositional invasive weed optimization , 2015, Appl. Soft Comput..

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

[51]  Yongquan Zhou,et al.  Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem , 2014, Neurocomputing.

[52]  Jinzhao Wu,et al.  A discrete invasive weed optimization algorithm for solving traveling salesman problem , 2015, Neurocomputing.

[53]  K. R. Baker,et al.  An investigation of due-date assignment rules with constrained tightness , 1981 .

[54]  Shengyao Wang,et al.  A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion , 2015, Knowl. Based Syst..

[55]  Richard F. Hartl,et al.  Supply chain dynamics, control and disruption management , 2016 .

[56]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[57]  Pavlos I. Lazaridis,et al.  Design of a Novel Antenna Array Beamformer Using Neural Networks Trained by Modified Adaptive Dispersion Invasive Weed Optimization Based Data , 2013, IEEE Transactions on Broadcasting.

[58]  Maghsud Solimanpur,et al.  Solving multi-objective portfolio optimization problem using invasive weed optimization , 2016, Swarm Evol. Comput..