An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop

In this paper, we present a constructive heuristic to minimize total flow time criterion for the well-known NP-hard no-wait flow shop scheduling problem. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. The initial sequence of jobs thus generated is further improved using a new job insertion technique. We show, through computational experimentation, that the proposed method significantly outperforms the best-known heuristics while retaining its time complexity of O(n^2). Statistical tests of significance are used to confirm the improvement in solution quality.

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

[2]  J. Gupta.  Optimal flowshop schedules with no intermediate storage space , 1976 .

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

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

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

[6]  Subhash C. Sarin,et al.  A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots , 2001 .

[7]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

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

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

[10]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

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

[12]  Knut Alicke,et al.  Dispatching in flowshops with bottleneck machines , 2007, Comput. Ind. Eng..

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

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

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

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

[17]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

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

[19]  Marcelo Seido Nagano,et al.  Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling , 2007, MICAI.

[20]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

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

[22]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[23]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[24]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[25]  Marcelo Seido Nagano,et al.  An Effective Heuristic for the No-Wait Flowshop with Sequence-Dependent Setup Times Problem , 2010, MICAI.

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

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

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

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

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

[31]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .