Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop

Abstract The aim of this paper is to propose heuristic algorithms for a two-stage flow-shop scheduling problem with multiprocessor tasks to minimize the makespan. The heuristic algorithms are constructive in nature. They schedule the tasks one at a time from a given sequence. The rules considered for sequencing the tasks are based on simple priority rules from the literature. Some lower bounds for the problem are also derived to be used in the performance analysis of the heuristic algorithms. Next, the average performance of the proposed heuristic algorithms is analyzed by a computational experiment using randomly generated problem instances. The results suggest that these heuristic algorithms are both efficient and effective. The paper concludes with a discussion of the insights obtained from the experimental analysis about this type of scheduling problems.

[1]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[2]  Mohamed Haouari,et al.  Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..

[3]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

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

[5]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[6]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[7]  Bo Chen.  Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .

[8]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

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

[10]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[11]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[12]  Ceyda Oguz,et al.  Scheduling multiprocessor tasks in a two-stage flow-shop environment , 1997 .

[13]  Marco Ferretti,et al.  Pyramidal Architectures for Computer Vision , 1994, Advances in Computer Vision and Machine Intelligence.

[14]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[15]  Peter Brucker,et al.  Shop scheduling problems with multiprocessor tasks on dedicated processors , 1995, Ann. Oper. Res..

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

[17]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[18]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[19]  Errol L. Lloyd,et al.  Concurrent Task Systems , 1981, Oper. Res..

[20]  Yu-Fai Fung,et al.  Real-time image interpretation on a multi-layer architecture , 1999, Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030).