Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem

We consider the problem of scheduling jobs in a hybrid flowshop with two stages. Our objective is to minimize both the makespan and the total completion time of jobs. This problem has been little studied in the literature. To solve the problem, we propose an ant colony optimization procedure. Computational experiments are conducted using random-generated instances from the literature. In comparison against other well-known heuristics from the literature, experimental results show that our algorithm outperforms such heuristics.

[1]  Ravi Shankar,et al.  A neuro-tabu search heuristic for the flow shop scheduling problem , 2004, Comput. Oper. Res..

[2]  Han Hoogeveen,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

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

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

[5]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[6]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

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

[8]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[9]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

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

[11]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[12]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

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

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

[15]  Daniel Merkle,et al.  An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.

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

[17]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[18]  Bo Chen,et al.  Scheduling Multiprocessor Flow Shops , 1994 .

[19]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[20]  Jairo R. Montoya-Torres,et al.  Scheduling jobs on a k-stage flexible flow-shop , 2004, Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004..

[21]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

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

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

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

[25]  Maged M. Dessouky,et al.  Flowshop scheduling with identical jobs and uniform parallel machines , 1998, Eur. J. Oper. Res..

[26]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[27]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

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