Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic

This study considers the scheduling problem of multistage hybrid flowshops with multiprocessor tasks, which is a core topic for numerous industrial applications. An effective and efficient heuristic, namely the heuristic of multistage hybrid flowshops (HMHF) is proposed to solve this problem. To verify the developed heuristic, computational experiments are conducted on a well-known benchmark problem set. The results are compared with 10 constructive heuristics and a tabu search (TS) based meta-heuristic from the relevant literature. These computational results show that the proposed HMHF heuristic is highly effective when compared to these algorithms for this problem on the same benchmark instances.

[1]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

[2]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

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

[4]  Antony Vignier,et al.  A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.

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

[6]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[7]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[8]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[9]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[10]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[11]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[12]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .

[13]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[14]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[15]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[16]  C. Proust,et al.  New lower bound for the hybrid flowshop scheduling problem , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.