Total completion time with makespan constraint in no-wait flowshops with setup times

The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated as separate from processing times. Several recent algorithms, an insertion algorithm, two genetic algorithms, three simulated annealing algorithms, two cloud theory-based simulated annealing algorithms, and a differential evolution algorithm are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that one of the nine proposed algorithms, one of the simulated annealing algorithms (ISA-2), performs much better than the others under the same computational time. Moreover, the analysis indicates that the algorithm ISA-2 performs significantly better than the earlier existing best algorithm. Specifically, the best performing algorithm, ISA-2, proposed in this paper reduces the error of the existing best algorithm in the literature by at least 90% under the same computational time. All the results have been statistically tested.

[1]  Taïcir Loukil,et al.  Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints , 2013, J. Math. Model. Algorithms.

[2]  Mohamed Haouari,et al.  Development of lower bounds for the scheduling of setup tasks in serial production lines , 2013 .

[3]  RadosÅ‚aw Rudek.  Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects , 2013 .

[4]  Mehmet Fatih Tasgetiren,et al.  A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem , 2013, Comput. Oper. Res..

[5]  Qingfu Zhang,et al.  A Self-guided Genetic Algorithm for permutation flowshop scheduling problems , 2012, Comput. Oper. Res..

[6]  B. Naderi,et al.  Multi-objective no-wait flowshop scheduling problems: models and algorithms , 2012 .

[7]  T. Elmekkawy,et al.  A meta-heuristic approach for solving the no-wait flow-shop problem , 2012 .

[8]  King-Wah Pang,et al.  A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness , 2013 .

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

[10]  Xiaoping Li,et al.  Complete local search with limited memory algorithm for no-wait job shops to minimize makespan , 2009, Eur. J. Oper. Res..

[11]  Rainer Leisten,et al.  A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness , 2006 .

[12]  Ali Allahverdi,et al.  The two stage assembly flowshop scheduling problem to minimize total tardiness , 2012, J. Intell. Manuf..

[13]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[14]  Tarek Y. ElMekkawy,et al.  A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion , 2012 .

[15]  Chin-Chia Wu,et al.  Single-machine group scheduling with a general learning effect , 2013 .

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

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

[18]  Mohammad Mehdi Sepehri,et al.  An environment-driven, function-based approach to dynamic single-machine scheduling , 2013 .

[19]  A. Allahverdi,et al.  Algorithms for no-wait flowshops with total completion time subject to makespan , 2013 .

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

[21]  Reha Uzsoy,et al.  Modeling and analysis of semiconductor manufacturing in a shrinking world: challenges and successes , 2008, WSC 2008.

[22]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[23]  Ali Allahverdi,et al.  Heuristics for no-wait flowshops with makespan subject to mean completion time , 2012, Appl. Math. Comput..

[24]  Ali Allahverdi,et al.  The significance of reducing setup times/setup costs , 2008, Eur. J. Oper. Res..

[25]  Rong-Hwa Huang,et al.  No-wait two-stage multiprocessor flow shop scheduling with unit setup , 2009 .

[26]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[27]  Tariq Aldowaisan,et al.  No-wait flowshops with bicriteria of makespan and total completion time , 2002, J. Oper. Res. Soc..

[28]  Rubén Ruiz,et al.  Some effective heuristics for no-wait flowshops with setup times to minimize total completion time , 2007, Ann. Oper. Res..

[29]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[30]  Nasser Salmasi,et al.  Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem , 2013, Comput. Ind. Eng..

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

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

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

[34]  A. Allahverdi,et al.  New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .

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

[36]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[37]  Mostafa Zandieh,et al.  Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics , 2012 .

[38]  Fariborz Jolai,et al.  A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times , 2012 .

[39]  Marc Gravel,et al.  A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times , 2012, Comput. Oper. Res..

[40]  Chung-Cheng Lu,et al.  Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups , 2012 .

[41]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[42]  Mostafa Zandieh,et al.  Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop , 2010, Adv. Eng. Softw..

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

[44]  J. Framiñan,et al.  An efficient heuristic for total flowtime minimisation in no-wait flowshops , 2010 .