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

Expert Systems with Applications

Volumn 37, Issue 2, 2010, Pages 1361-1368

  Yagmahan, Betul ^a   Yenisey, Mehmet Mutlu ^b  

^a ULUDAG UNIVERSITY   (Turkey)

^b ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Ant colony optimization; Flow shop scheduling; Flowtime; Heuristics; Makespan; Multi objective

Indexed keywords

ANT-COLONY OPTIMIZATION; FLOW-SHOP SCHEDULING; FLOW-TIME; MAKESPAN; MULTI OBJECTIVE;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; HEURISTIC METHODS; MACHINE SHOP PRACTICE; MULTIOBJECTIVE OPTIMIZATION; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 71749114629     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.06.105     Document Type: Article

References (58)

1. Baker K.R. Introduction to sequencing and scheduling (1974), John Wiley, New York
2. Bullnheimer B., Hartl R.F., and Strauss C. A new rank-based version of the ant system: a computational study. Central European Journal for Operations Research and Economics 7 1 (1999) 25-38
3. Chang P.C., Hsieh J.C., and Lin S.G. The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem. International Journal of Production Economics 79 3 (2002) 171-183
4. Chen C.L., Vempati V.S., and Aljaber N. An application of genetic algorithms for flow shop problems. European Journal Of Operational Research 80 (1995) 389-396
5. Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In Proceedings, European conference on artificial life (pp. 134-142), Paris, France.
6. Colorni, A., Dorigo, M.. & Maniezzo, V. (1992). An investigation of some properties of an ant algorithm. In Proceedings, parallel problem solving from nature conference) (pp. 509-520), Brussels, Belgium.
7. Daniels R.L., and Chambers R.J. Multiobjective flowshop scheduling. Naval Research Logistics Quarterly 37 (1990) 981-995
8. Dannenbring D.G. An evaluation of flowshop sequencing heuristics. Management Science 23 11 (1977) 1174-1182
9. Dorigo M., and Di Caro G. The ant colony optimization meta-heuristic. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, London, UK 11-32
10. Dorigo, M., Maniezzo, V., & Colorni, A. (Eds.). (1991a). Positive Feedback as a Search Strategy, Technical Report, No. 91-016, Politecnico di Milano, Italy.
11. Dorigo, M., Maniezzo, V., & Colorni, A., (Eds.) (1991b). The Ant System: An Autocatalytic Optimizing Process, Technical Report, No. 91-016 (Revised), Politecnico di Milano, Italy.
12. Dorigo M., Maniezzo V., and Colorni A. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26 1 (1996) 29-41
13. Dorigo M., and Stützle T. Ant colony optimization (2004), MIT Press, Berlin
14. Framinan J.M., Leisten R., and Ruiz-Usano R. Efficient heuristics for flowshop sequencing with objectives of makespan and flowtime minimization. European Journal of Operational Research 141 (2002) 561-571
15. Gambardella, L. M. & Dorigo, M. (1995). Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings, 12th international conference on machine learning (pp. 252-260), Tahoe City, CA.
16. Gambardella, L. M. & Dorigo, M. (1996). Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings, IEEE international conference on evolutionary computation (pp. 622-627), Pisca-taway, NJ.
17. Gao H., and Liu X. Improved artificial immune algorithm and its applications on permutation flow shop sequencing problems. Information Technology Journal 6 6 (2007) 929-933
18. Gupta J.N.D. A improved combinatorial algorithm for the flowshop scheduling problem. Operations Research 19 (1971) 1753-1758
19. Gupta J.N.D., Hennig K., and Werner F. Minimizing total flowtime in a 2-machine flow shop problem with minimum makespan. International Journal of Production Economics 69 (2001) 323-338
20. Gupta J.N.D., Palanimuthy N., and Chen C.L. Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion. Production Planning and Control 10 (1999) 251-265
21. Huang, G., & Lim, A. (2003). Fragmental optimization on the 2-machine bicriteria flowshop scheduling problem. Proceedings of the 15th IEEE international conference on tools with artificial intelligence (ICTAI) (p.194).
22. Hundal T.S., and Rajgopal J. An extension of Palmer' s heuristic for flowshop scheduling problem. International Journal of Production Research 26 (1988) 1119-1124
23. Ishibuchi H., Misaki S., and Tanaka H. Modified simulated annealing algorithms for the flow shop sequencing problem. European Journal of Operational Research 81 2 (1995) 388-398
24. Ishibuchi H., and Murata T. A multiobjective genetic local search algorithm and its applications to flowshop scheduling. IEEE Transactions on Systems Man And Cybernetics-Part C: Applications and reviews 28 3 (1998) 392-403
25. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 1 (1954) 61-68
26. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175 (2006) 773-785
27. Nagar A., Haddock J., and Heragu S.S. A branch-and-bound approach for a two-machine flowshop scheduling problem. Journal of the Operational Research Society 46 6 (1995) 721-734
28. Nawaz M., Enscore Jr. E., and Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11 1 (1983) 91-95
29. Neppalli V.R., Chen C.L., and Gupta J.N.D. Genetic algorithms for the two-stage bicriteria flowshop problem. European Journal of Operational Research 95 2 (1996) 356-373
30. Nowichi E., and Smutnicki C. A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91 (1996) 160-175
31. Nowichi E., and Smutnicki C. Some aspects of scatter search in the flow-shop problem. European Journal of Operational Research 169 (2006) 654-666
32. Ogbu F.A., and Smith D.K. Simulated annealing for the permutation flowshop problem. OMEGA 19 (1991) 64-67
33. Onwubolu G., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 (2006) 674-692
34. Osman I.H., and Potts C.N. Simulated annealing for permutation flow-shop scheduling. OMEGA 17 6 (1989) 551-557
35. Palmer D.S. Sequencing jobs through a multi-stage process in the minimum total time - A quick method of obtaining near optimum. Journal of the Operational Research Society 16 1 (1965) 101-107
36. Pasupathy T., Rajendran C., and Suresh R.K. A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. International Journal of Advanced Manufacturing Technology 27 (2006) 804-815
37. Rajendran C. Two-stage flowshop scheduling problem with bicriteria. Journal of the Operational Research Society 43 9 (1992) 871-884
38. Rajendran C. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research 82 (1995) 540-555
39. Rajendran C., and Ziegler H. Ant-colony algorithms for flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 2 (2004) 426-438
40. Ravindran D., Noorul Haq A., Selvakuar S.J., and Sivaraman R. Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advanced Manufacturing Technology 25 (2005) 1007-1012
41. Reeves C.R. A genetic algorithm for flow shop sequencing. Computers and Operations Research 22 1 (1995) 5-13
42. Selen W.J., and Hott D. A mixed integer goal programming formulation of the standart flowshop scheduling problem. Journal of the Operational Research Society 37 (1986) 1121-1128
43. Smith M.L., and Dubek R.A. A general algorithm for solution of the n-job, m-machine sequencing problem of the flowshop. Operations Research 15 (1967) 71-82
44. Stützle, T. (1998). An ant approach to the flow shop problem. In Proceedings, 6th European congress on intelligent techniques and soft computing (EUFIT' 98) (pp. 1560-1564), Aachen, Germany.
45. Stützle, T., & Hoos, H. (Eds.). (1996). Improving the Ant System: A Detailed Report on MAX-MIN Ant System, Technical Report, AIDA-96-12 (Revised version), Darmstadt University of Technology, Computer Science Department, Darmstadt.
46. Stützle, T., & Hoos, H. (1997). The MAX-MIN ant system and local search for the traveling salesman problem. In Proceedings, IEEE international conference on evolutionary computation (pp. 308-313), Indianapolis, Indiana, USA.
47. Stützle T., and Dorigo M. The ant colony optimization metaheuristic: Algorithms, applications, and advances. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Norwell, MA 251-285
48. Taillard E. Some efficient heuristic methods for the flowshop-sequencing problem. European Journal of Operational Research 47 1 (1990) 65-74
49. Taillard E. Benchmarks for basic scheduling problems. European Journal Of Operational Research 64 (1993) 278-285
50. T'kindt V., Gupta J.N.D., and Billaut J.C. Two-machine flowshop scheduling with a secondary criterion. Computers and Operations Research 30 4 (2003) 505-526
51. T'kindt V., Monmarché N., Tercinet F., and Laügt D. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research 142 (2002) 250-257
52. Varadharajan T.K., and Rajendran C. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research 167 (2005) 772-795
53. Widmer M., and Hertz A. A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research 41 (1989) 186-193
54. Wilson J.M. Alternative formulations of a flowshop scheduling problem. Journal of Operations Research Society 40 4 (1989) 395-399
55. Yaǧmahan, B. (2005). Ant colony optimization for multi-objective flow shop scheduling problem, Istanbul Technical University, Ph.D., thesis, Department of Industrial Engineering, Istanbul, Turkey [in Turkish].
56. Yaǧmahan B., and Yenisey M.M. Ant colony optimization parameter tuning for flow shop scheduling problem. ITU Journal Series D: Engineering 5 2 (2006) 133-141 [in Turkish]
57. max scheduling problem. The International Journal of Advanced Manufacturing Technology 20 6 (2002) 464-473
58. Ying K.C., and Liao C.J. An ant colony system for permutation flow-shop sequencing. Computers and Operations Research 31 5 (2004) 791-801