Ant colony optimization algorithm with multiple visibility matrices for the resolution of a problem of industrial plant scheduling;Algorithme d'optimisation par colonie de fourmis avec matrices de visibilité multiples pour la résolution d'un problème d'ordonnancement industriel

INFOR

Volumn 40, Issue 3, 2002, Pages 259-276

  Gagné, Caroline ^a   Gravel, Marc ^a   Price, Wilson L ^b  

^a UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Ant colony optimization; Metaheuristic; Multiple objectives; Scheduling; Sequence dependent setups

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; METAL CASTING; OPTIMIZATION; PROBLEM SOLVING;

SCHEDULING PROBLEMS;

SCHEDULING;

EID: 18344414102     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.2002.11732657     Document Type: Article

References (27)

1. Allahverdi A., Gupta J.N.D. and T. Aldowaisan (1999), A review of scheduling research involving setup considerations, Omega, 27, 219-239.
2. Colorni A., Dorigo M. and V. Maniezzo (1991), Distributed optimization by ant-colonies, in Proceedings of the European Conference on Artificial Life (ECAL'91), edited by F. Varela and P. Bourgine, 134-142, Cambridge, Mass, USA, MIT Press.
3. Conover W.J. and R.L. Iman (1981), Rank transformations as a bridge between parametric and nonparametric statistics, The American Statistician, 35, 124-129.
4. Conway R.W., Maxwell W.L. and L.W. Miller (1967), Theory of scheduling, Addison Wesley, MA.
5. Das S.R., Gupta J.N.D. and B.M Khumawala (1995), A saving index heuristic algorithm for flowshop scheduling with sequence dependent set-up times, The Journal of the Operational Research Society, 46, 1365-1373.
6. Deneubourg J.L., Pasteels J.M. and J.C. Verhaeghe (1983), Probabilistic behaviour in ants: A strategy of errors?, Journal of Theorical Biology, 105, 259-271.
7. Deneubourg J.L. and S. Goss (1989), Collective patterns and decision-making, Ethology & Evolution, 1, 295-311.
8. Dorigo M. (1992), Optimization, learning and natural algorithms, Ph.D. Thesis, Politecnico di Milano, Italy.
9. Dorigo M. and G. Di Caro (1999), The Ant Colony Optimization Meta-Heuristic, In: D. Corne, M. Dorigo and F. Glover Editors, New Ideas in Optimization, McGraw-Hill.
10. Dorigo M. and L.M. Gambardella (1997), Ant colonies for the traveling salesman problem, BioSystems, 43, 73-81.
11. Dorigo M., Maniezzo V. and A. Colorni (1991), Positive feedback as a search strategy, Technical Report No 91-016, Politecnico di Milano, Italy, 20 pages.
12. Dorigo M., Maniezzo V. and A. Colorni (1996), Ant system: optimization by a colony of cooperating agents, IEEE transactions on System, Man & Cybernitic, 26 (1), 29-41.
13. Du J. and J.Y. Leung (1990), Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research, 15, 483-494.
14. Franca P.M., Gendreau M., Laporte G. and F.M. Muller (1996), A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times, International Journal of Production Economics, 43, 79-89.
15. Gagné C., Price W.L. and M. Gravel (2002), Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times, Journal of the Operational Research Society, 53, 895-906.
16. Gravel M., Price W. and C. Gagné (2000), Scheduling jobs in a Alcan aluminium factory using a genetic algorithm, International Journal of Production Research, 38 (13), 3031-3041.
17. Gravel M., Price W. and C. Gagné (2002), Scheduling continuous casting of aluminum using a multiple-objective ant colony optimization metaheuristic, European Journal of Operational Research, (In press).
18. Johnson D.S. and L.A. McGeoch (1997), The traveling salesman problem: a case study in local optmization, Local Search in Combinatorial Optimization, E.H.L. Aarts & J.K. Lenstra editors, John Wiley and Sons Ltd., 215-310.
19. Koulamas C. (1994), The total tardiness problem: review and extensions, Operations research, 42 (6), 1025-1041.
20. Pinedo M. (1995), Scheduling theory, algorithms and systems, Prentice-Hall, NJ.
21. Ragatz G.L. (1993), A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times, Proceedings: Twenty-fourth Annual Meeting of the Decision Sciences Institute, 1375-1377.
22. Rubin P.A. and G.L. Ragatz (1995), Scheduling in a sequence dependent setup environment with genetic search, Computers and Operations Research, 22 (2), 85-99.
23. Tan K.C. and R. Narasimhan (1997), Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach, Omega, 25 (6), 619-634.
24. Tan K.C., Narasimhan R., Rubin PA. and G.L. Ragatz (2000), A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times, Omega, 28, 313-326.
25. Wilbrecht J.K. and W.B. Prescott (1969). The influence of setup time on job performance, Management Science, 16, 274-280.
26. Wortman D.B. (1992), Managing capacity: getting the most from your firms assets, Industrial Engineering, 24, 47-49.
27. Yang W.-H. and C.-J. Liao (1999), Survey of scheduling research involving setup times, International Journal of Systems Science, 30 (2), 143-155.