PII: S0377-2217(02)00265-5

Abstract Consider the 2-machine flowshop scheduling problem with the objective of minimizing both the total completion time and the makespan criteria. The latter is assumed to be optimized prior to the former. In view of the NP -hardness of the problem an Ant Colony Optimization approach is proposed to solve it. The heuristic also uses feature of Simulated Annealing search and local search algorithms. Computational experiments show its effectiveness compared to existing heuristics. The extension to the total completion time problem is also studied.

[1]  陳春龍,et al.  Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion , 1999 .

[2]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[3]  P Dileepan,et al.  Bicriterion static scheduling research for a single machine , 1988 .

[4]  Timothy D. Fry,et al.  A framework for single machine multiple objective sequencing research , 1989 .

[5]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

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

[7]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[8]  Serpil Sayin,et al.  A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..

[9]  R. W. Blackmor,et al.  A Course in Theoretical Statistics , 1970 .

[10]  Chandrasekharan Rajendran,et al.  Two-Stage Flowshop Scheduling Problem with Bicriteria , 1992 .

[11]  J. A. Hoogeveen,et al.  Single-machine bicriteria scheduling , 1992 .

[12]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[13]  Venkata Ranga Neppalli,et al.  Minimizing total flow time in a two-machine flowshop problem with minimum makespan , 2001 .

[14]  Funda Sivrikaya-Serifoglu,et al.  A bicriteria two-machine permutation flowshop problem , 1998, Eur. J. Oper. Res..

[15]  A. Nagar,et al.  Multiple and bicriteria scheduling : A literature survey , 1995 .

[16]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[17]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[18]  Inman Harvey,et al.  Fourth European Conference on Artificial Life , 1997 .

[19]  Wei-Chang Yeh.  A new branch-and-bound approach for the n/2/flowshop/alphaF+betaCmax flowshop scheduling problem , 1999, Comput. Oper. Res..

[20]  Roberto Tadei,et al.  Recovering Beam Search - A hybrid heuristic method for combinatorial optimization problems , 2002 .

[21]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[22]  Jatinder N. D. Gupta,et al.  Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .

[23]  Sunderesh S. Heragu,et al.  A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem , 1995 .

[24]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..