New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem

Scheduling in a production workshop consists of assigning a number of different tasks to the existing machines with respect to the constraints of the problem in order to optimise the objective function. In this paper, we focus on the NoWait Flow Shop Scheduling Problem (NWFSSP) with the makespan objective. We present a new hybrid algorithm NEWGRASP-DE that combines Greedy Randomised Adaptive Search Procedure (GRASP) with Differential Evolution Algorithm (DEA). Furthermore, we used an Iterative Local Search (ILS) as an improvement phase in the GRASP method. Our algorithm is tested on instances that have been proposed in the literature. We compared our results with those of different authors. The experimental results show the effectiveness of our algorithm.

[1]  Andreas Fink,et al.  Fitness landscape analysis for the no-wait flow-shop scheduling problem , 2012, J. Heuristics.

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

[3]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[4]  M. F. Tasgetiren,et al.  A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[5]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[6]  Han Hoogeveen,et al.  Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..

[7]  Roman Senkerik,et al.  Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan , 2013, Math. Comput. Model..

[8]  Bassem Jarboui,et al.  A hybrid genetic algorithm for solving no-wait flowshop scheduling problems , 2011 .

[9]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[10]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[11]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[12]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[13]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[14]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[15]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[16]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[17]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[18]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

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

[20]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[21]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[22]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

[23]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

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

[25]  Xiaoping Li,et al.  Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion , 2010, Eur. J. Oper. Res..

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

[27]  Thomas Sttzle,et al.  Applying iterated local search to the permutation ow shop problem , 1998 .

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

[29]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[30]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[31]  S. Shyu,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[32]  B. Gonazelez,et al.  A hybrid genetic algorithm approach for the “no-wait” flowshop scheduling problem , 1995 .

[33]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[34]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[35]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[36]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

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

[38]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[39]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

[40]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[41]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

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