Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem

Applied Mathematics and Computation

Volumn 187, Issue 2, 2007, Pages 989-998

  Heinonen, J ^a   Pettersson, F ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

ACO; Ant colony optimization; Hybrid; Job shop scheduling; Optimization; Scheduling

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ANT COLONY OPTIMIZATION; JOB SHOP SCHEDULING; POSTPROCESSING ALGORITHMS;

JOB ANALYSIS;

EID: 34247223607     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.09.023     Document Type: Article

References (18)

1. Panwalker S.S., and Iskander W. A survey of scheduling rules. Oper. Res. 25 1 (1977) 45-61
2. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34 (1988) 391-401
3. Van Laarhoven P.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by simulated annealing. Oper. Res. 40 (1992) 113-125
4. E. Taillard, Parallel Tabu Search Technique for the Jobshop Scheduling Problem, Internal Report ORWP 89/11, Departemente de Mathematiques, Ecole Polytechnique Federale de Lausanne, Lausanne, 1989.
5. R. Nakano, T. Yamada, Conventional Genetic Algorithm for Job Shop Problems, in: Proc. of the 4th Int. Conf. on Genetic Algorithms, San Diego, Californa, 1991, pp. 474-479.
6. M. Dorigo, Optimization, Learning and Natural Algorithms, Ph.D. Thesis, Dipartemento di Elettronica, Politecnico di Milano, 1992.
7. Dorigo M., Maniezzo V., and Colorni A. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man. Cybernet. Part B 26 1 (1996) 29-41
8. Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolutionary Comput. 1 1 (1997) 53-66
9. Bullnheimer B., Hartl R., and Strauss C. A new rank-based version of the Ant System: A computational study. Central European J. Oper. Res. Econom. 7 1 (1999) 25-38
10. Stützle T., and Hoos H.H. MAX-MIN ant system. Future Generat. Comput. Syst. 16 8 (2000) 889-914
11. Blum C., and Dorigo M. The hyper-cube framework for ant colony optimization. IEEE Trans. Syst. Man. Cybernet. Part B 34 2 (2004) 1161-1172
12. Colorni A., Dorigo M., Maniezzo V., and Trubian M. Ant system for job-shop scheduling. Belgian J. Oper. Res., Stat. Comput. Sci. 34 (1993) 39-54
13. Jayaraman V.K., Kulkarni B.D., Karale S., and Shelokar P. Ant colony framework for optimal design and scheduling of batch plants. Comput. Chem. Eng. 24 (2000) 1901-1992
14. Bell J.E., and McMullen P.R. Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18 (2004) 41-48
15. Gutjahr W.J., and Rauner M.S. An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comp. Oper. Res. 41 3 (2007) 642-666
16. Ying K.-C., and Liao C.-J. An ant colony system for permutation flow-shop sequencing. Comput. Oper. Res. 31 (2004) 791-801
17. Gajpal Y., and Rajendran C. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. Int. J. Prod. Econom. 101 (2006) 259-272
18. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job-shop problem. Manage. Sci. 42 6 (1996) 797-813