A Metaheuristic for No-wait Flowshops with Variable Processing Times

No-wait flowshop scheduling problems are widespread in industries. Though processing times of jobs are traditionally assumed to be constant, they are variable because of learning and deteriorating effects in practical manufacturing processes which make the problems much more difficult. In this paper, we propose a metaheuristic, self-adaptive memetic algorithm (SAMA for short), for no-wait flowshops with variable processing times which have never been considered yet. The balance between intensification and diversification of the algorithm is adaptively controlled by evolutionary operators. Local search is performed on better individuals with higher probabilities to dynamically adjust diversification. Experimental results show that the proposed SAMA outperforms existing algorithms for similar problems.

[1]  Wen-Chiung Lee,et al.  Scheduling with general position-based learning curves , 2011, Inf. Sci..

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

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

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

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

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

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

[8]  Dar-Li Yang,et al.  Scheduling with deteriorating jobs and learning effects , 2011, Appl. Math. Comput..

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

[10]  Suh-Jenq Yang,et al.  Computers and Mathematics with Applications Minimizing the Total Completion Time in Single-machine Scheduling with Aging/deteriorating Effects and Deteriorating Maintenance Activities , 2022 .

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

[12]  Quan-Ke Pan,et al.  Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .

[13]  Marcelo Seido Nagano,et al.  Review and classification of constructive heuristics mechanisms for no-wait flow shop problem , 2016 .

[14]  Ji-Bo Wang,et al.  Learning effect and deteriorating jobs in the single machine scheduling problems , 2009 .

[15]  T. C. Edwin Cheng,et al.  Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan , 2007, Eur. J. Oper. Res..

[16]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[17]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Xiaoping Li,et al.  Deteriorating and position-based learning effects on some single-machine scheduling problems , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[20]  T. C. Edwin Cheng,et al.  Scheduling Problems with the Effects of deterioration and Learning , 2007, Asia Pac. J. Oper. Res..

[21]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[22]  G. Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning , 2009 .