Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing

For the past two decades simulated annealing has been playing a crucial role in the design of optimization strategies for flow shop scheduling applications. This paper presents an efficient simulated annealing algorithm for minimizing the total flow time in permutation flow shop scheduling problems. Empirical results demonstrate the improvement in solution quality obtained by the proposed approach over state-of-the-art methods in the literature.

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

[2]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

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

[4]  Alain Guinet,et al.  Reduction of job-shop problems to flow-shop problems with precedence constraints , 1998, Eur. J. Oper. Res..

[5]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[6]  Andrew Lim,et al.  Two-machine flow shop problems with a single server , 2006, J. Sched..

[7]  Marco Taisch,et al.  Advanced computing techniques in Production Planning and Control , 1999 .

[8]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[11]  Erwin Kreyszig,et al.  Advanced Engineering Mathematics, Maple Computer Guide , 2000 .

[12]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[13]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[14]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[15]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

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

[17]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

[19]  Ali Allahverdi,et al.  No-wait flowshops with bicriteria of makespan and maximum lateness , 2004, Eur. J. Oper. Res..

[20]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

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

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

[23]  F. W. Kellaway,et al.  Advanced Engineering Mathematics , 1969, The Mathematical Gazette.

[24]  Uday K. Chakraborty,et al.  An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling , 2008 .

[25]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

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

[27]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[28]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[29]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

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

[31]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .

[32]  Uday Kumar Chakraborty,et al.  An improved heuristic for permutation flowshop scheduling , 2007, Int. J. Inf. Commun. Technol..

[33]  Manoj Kumar Tiwari,et al.  Psycho-Clonal algorithm based approach to solve continuous flow shop scheduling problem , 2006, Expert Syst. Appl..

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

[35]  E. Kreyszig,et al.  Advanced Engineering Mathematics. , 1974 .

[36]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[37]  C. Rajendran,et al.  A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case study , 1997 .

[38]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

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

[40]  Uday Kumar Chakraborty,et al.  An efficient stochastic hybrid heuristic for flowshop scheduling , 2007, Eng. Appl. Artif. Intell..

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

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

[43]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[44]  J E C Arroyo,et al.  A partial enumeration heuristic for multi-objective flowshop scheduling problems , 2004, J. Oper. Res. Soc..

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