Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion Time

No-wait flowshops circumscribe an important class of sequencing problems in the field of production planning. For no-wait flowshops with total completion time minimization, a permutation of jobs should be find to be processed sequentially on a number of machines under the restriction that each job is processed continuously. This is a typical NP-hard combinatorial optimization problem. In this paper, a new hybrid heuristic algorithm is proposed which is based on PH1p algorithm. PH1p is modified by replacing Nawaz-Enscore-Ham (NEH) insertion operator with FL method. A composite algorithm is adopted to generate an advantageous initial seed. Based on well-known benchmarks and comparisons with some existing algorithms, simulation results demonstrate the effectiveness of the proposed hybrid algorithm.

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

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

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

[4]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

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

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

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

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

[9]  K. R. Baker,et al.  Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues , 1974 .

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

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

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

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

[14]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria , 1994 .

[15]  Tariq A. Aldowaisan,et al.  No-wait and separate setup three-machine flowshop with total completion time criterion , 2000 .

[16]  René van Dal,et al.  Solvable Cases of the No-Wait Flow-Shop Scheduling Problem , 1991 .

[17]  Xiao-Ping Li,et al.  A heuristic for total flowtime minimization in flow shop scheduling , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[18]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

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

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

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

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

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