A multi-objective ant colony system algorithm for flow shop scheduling problem

In this paper, we consider the flow shop scheduling problem with respect to the both objectives of makespan and total flowtime. This problem is known to be NP-hard type in literature. Several algorithms have been proposed to solve this problem. We present a multi-objective ant colony system algorithm (MOACSA), which combines ant colony optimization approach and a local search strategy in order to solve this scheduling problem. The proposed algorithm is tested with well-known problems in literature. Its solution performance was compared with the existing multi-objective heuristics. The computational results show that proposed algorithm is more efficient and better than other methods compared.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[2]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

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

[4]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[5]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[6]  Tapan P. Bagchi,et al.  Multiobjective Flowshop Scheduling , 1999 .

[7]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

[8]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[10]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

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

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

[13]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[14]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

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

[17]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

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

[19]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

[20]  Andrew Lim,et al.  Fragmental optimization on the 2-machine bicriteria flowshop scheduling problem , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[21]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[22]  Xiyang Liu,et al.  Improved Artificial Immune Algorithm and its application on the Permutation Flow Shop Sequencing Problems , 2007 .

[23]  Jatinder N. D. Gupta,et al.  Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem , 1971, Oper. Res..

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

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

[26]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

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

[28]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[29]  John M. Wilson,et al.  Alternative Formulations of a Flow-shop Scheduling Problem , 1989 .

[30]  Marco Dorigo.  Ant colony optimization , 2004, Scholarpedia.

[31]  Marcello Braglia,et al.  A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness , 2009 .

[32]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[33]  W. Yeh.  A Memetic Algorithm for the n/2/Flowshop/αF + βCmax Scheduling Problem , 2002 .

[34]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[35]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

[37]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[38]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[39]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

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

[41]  D. Ravindran,et al.  Flow shop scheduling with multiple objective of minimizing makespan and total flow time , 2005 .

[42]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[43]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[44]  R. L. Daniels,et al.  Multiobjective flow-shop scheduling , 1990 .

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

[46]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

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

[48]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[49]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

[50]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

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

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

[53]  Willem Selen,et al.  A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem , 1986 .

[54]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

[55]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[56]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[57]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[58]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[59]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[60]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .