Development of new features of ant colony optimization for flowshop scheduling

International Journal of Production Economics

Volumn 112, Issue 2, 2008, Pages 742-755

  Lin, B M T ^a   Lu, C Y ^b   Shyu, S J ^c   Tsai, C Y ^c  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^c MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Bicriteria; Flowshop scheduling; Makespan; Total completion time

Indexed keywords

HEURISTIC METHODS; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

ANT COLONY OPTIMIZATION (ACO); TOTAL COMPLETION TIME;

FEATURE EXTRACTION;

EID: 39649117983     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2007.06.007     Document Type: Article

References (57)

1. Bauer, A., Bullnnherimer, B., Hartl, R.F., Strauss, C., 1999. An ant colony optimization approach for the single machine total tardiness problem. In: Proceedings of the 1999 Congress on Evolutionary Computation. Washington, DC, USA, pp. 1445-1450.
2. Beckers R., Deneubourg J.L., and Goss S. Trails and U-turns in the selection of the shortest path by the ant Lasius niger. Journal of Theoretical Biology 159 (1992) 397-415
3. den Besten, M., Stützle, T., Dorigo, M., 2000. Ant colony optimization for the total weighted tardiness problem. In: Proceedings of Parallel Problem Solving from Nature Conference. Also available as Tech.Rep.IRIDIA/99-16, Université Libre de Bruxelles, Belgium.
4. Brucker P. Scheduling Algorithms (1997), Springer, Berlin
5. Bullnheimer, B., Kotsis, G., Strauβ, C., 1998. Parallelization strategies for the ant system. High Performance Algorithms and Software in Nonlinear Optimization; Series: Applied Optimization, vol. 24, Kluwer, Dordrecht, pp. 87-100.
6. Bullnheimer B., Hartl R.F., and Strauss C. Applying the Ant System to the Vehicle Routing Problem. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1999), Kluwer, Boston
7. Bullnheimer, B., Hartl, R.F., Strauss, C., 1999b. An improved ant system algorithm for the vehicle routing problem. In: The Sixth Viennese Workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna, Austria, May 21-23.
8. Cadambi B.W., and Sathe Y.S. Two-machine flowshop scheduling to minimize mean flow time. Operations Research 30 1 (1993) 35-41
9. Colorni, A., Dorigo, M., Maniezzo, V., 1991. The ant system: An autocatatlytic process. Technical Report No. 91-016, Politecnico di Milano, Italy.
10. Colorni A., Dorigo M., Maniezzo V., and Trubian M. Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science 34 1 (1994) 39-53
11. Colorni A., Dorigo M., Maffioli F., Maniezzo V., Righini G., and Trubian M. Heuristics from nature for hard combinatorial problems. International Transactions in Operational Research 3 1 (1996) 1-21
12. Della Croce F., Narayan V., and Tadei R. The two-machine total completion time flow shop problem. European Journal of Operational Research 90 2 (1996) 227-237
13. Della Croce F., Ghirardi M., and Tadei R. An improved branch-and-bound algorithm for the two-machine total completion time flow shop problem. European Journal of Operational Research 139 2 (2002) 293-301
14. Di Caro G., and Dorigo M. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9 (1998) 317-365
15. Dorigo, M., 1992. Optimization, learning and natural algorithms. Ph.D. Thesis, Politecnico di Milano, Italy.
16. Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computing 1 (1997) 53-66
17. 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 (1996) 29-41
18. Dorigo M., Di Caro G., and Gambardella L.M. Ant algorithms for discrete optimization. Artificial Life 5 3 (1999) 137-172
19. Dudek R.A., Panwalkar S.S., and Smith M.L. The lessons of flowshop scheduling research. Operations Research 40 (1992) 7-13
20. Ferretti I., Zanoni S., and Zavanella L. Production-inventory scheduling using ant system metaheuristic. International Journal of Production Economics 104 2 (2006) 317-326
21. Forsyth, P., Wren, A., 1997. An ant system for bus driver scheduling. In: The Seventhth International Workshop on Computer-Aided Scheduling of Public Transport, Boston, August 1997.
22. Gajpal Y., and Rajendran C. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics 101 2 (2006) 259-272
23. Gambardella L.M., Taillard E., and Dorigo M. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50 (1999) 167-176
24. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and job shop scheduling. Mathematics of Operations Research 1 (1979) 117-129
25. Glover F. Tabu search: A tutorial. Interfaces 20 (1990) 74-94
26. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Learning (1989), Addison Wesley, New York, NY
27. Goss S., Aron S., Deneubourg J.L., and Pasteels J.M. Self-organized shortcuts in the argentine ant. Naturwissenschaften 76 (1989) 579-581
28. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnoy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
29. Holland J.H. Adaptation in Natural and Artificial System (1975), The University of Michigan, Ann Arbor
30. Hölldobler B., and Wilson E.O. Journey to the Ants: A Story of Scientific Exploration (1994), Harvard University Press, USA
31. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-67
32. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
33. Kuntz P., and Snyers D. Emergent colonization and graph partitioning. Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3 (1994), MIT Press, Cambridge, MA
34. i scheduling problem. European Journal of Operational Research 132 2 (2001) 439-452
35. Maniezzo, V., Colorni, A., Dorigo, M., 1994. The ant system applied to the quadratic assignment problem. Technical Report IRIDIA/94-28, Université Libre de Bruxelles, Belgium.
36. Merkle D., and Middendorf M. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. Applied Intelligence 18 1 (2003) 105-111
37. Middendorf M., Reischle F., and Schmeck H. Multi colony ant algorithms. Journal of Heuristics 8 3 (2002) 305-320
38. Nagar A., Haddock J., and Heragu S.S. Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research 81 1 (1995) 88-104
39. Nawaz M., Enscore Jr. E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA 11 1 (1983) 91-95
40. Pinedo M. Scheduling: Theory, Algorithms, and Systems. second ed (2002), Prentice-Hall, New York, NY
41. Ramos, V., Almeida, F., 2000. Artificial ant colonies in digital image habitats-a mass behavior effect study on pattern recognition. In: Proceedings of ANTS'2000-Second International Workshop on Ant Algorithms, Brussels, Belgium, pp. 113-116.
42. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29 1 (1993) 65-73
43. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 2 (2004) 426-438
44. Randall M., and Lewis A. A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing 62 9 (2002) 1421-1432
45. Reisman R.A., Kumar A., and Motwani J. Flowshop scheduling/sequencing research: A statistical review of the literature. 1952-1994. IEEE Transactions on Engineering Management 44 3 (1997) 316-329
46. Schoonderwoerd R., Holland O., Bruten J., and Rothkrantz L. Ant-based load balancing in telecommunications networks. Adaptive Behavior 5 2 (1997) 169-207
47. Shyu S.J., Yin P.Y., Lin B.M.T., and Haouari A. Ant-Tree: An ant colony optimization approach to the generalized minimum spanning tree problem. Journal of Experimental and Theoretical Artificial Intelligence 15 (2003) 103-112
48. Shyu S.J., Lin B.M.T., and Yin P.Y. An application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total complete time. Computers & Industrial Engineering 47 (2004) 181-193
49. Shyu S.J., Lin B.M.T., and Hsiao T.S. Ant colony optimization algorithm for the cell assignment problem in PCS networks. Computers & Operations Research 33 6 (2004) 1713-1740
50. Shyu S.J., Yin P.Y., and Lin B.M.T. An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research 131 (2004) 283-304
51. Stützle, T., 1998a. An ant approach to the flow shop problem. In: Proceedings of EUFIT'98, Aachen, pp. 1560-1564.
52. Stützle T. Parallelization strategies for ant colony optimization. Proceedings of Parallel Problem Solving from Nature vol. 1498 (1998), Springer, Berlin 722-741
53. Stützle T., and Dorigo M. ACO Algorithms for the Traveling Salesman Problem. Evolutionary Algorithms in Engineering and Computer Science (1999), Wiley, NY
54. Stützle T., and Dorigo M. ACO Algorithms for the Quadratic Assignment Problem. New Ideas in Optimization (1999), McGraw-Hill, New York, NY
55. Stützle, T., Hoos, H., 1997. The max-min ant system and local search for the traveling salesman problem. In: Proceedings of ICEC'97, pp. 309-314.
56. Talbi E., Roux O., Fonlupt C., and Robillard D. Parallel ant colonies for combinatorial optimization problems. Proceedings of Parallel and Distributed Processing vol. 1586 (1999), Springer, Berlin 239-247
57. 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 2 (2002) 250-257