Ant Colony Optimisation for Job Shop Scheduling

@misc{citeulike:2694782, abstract = {. A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm's implementation and performance when applied to job shop scheduling. The algorithm parameter settings seem to play a crucial role ...}, author = {van der Zwaan, S. and Marques, C. }, citeulike-article-id = {2694782}, keywords = {aco, scheduling}, posted-at = {2008-04-21 10:37:00}, priority = {2}, title = {Ant Colony Optimisation for Job Shop Scheduling}, url = {http://citeseer.ist.psu.edu/vanderzwaan99ant.html}, year = {1999} }

TY - GEN ID - citeulike:2694782 L3 - citeulike-article-id:2694782 TI - Ant Colony Optimisation for Job Shop Scheduling N2 - . A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm's implementation and performance when applied to job shop scheduling. The algorithm parameter settings seem to play a crucial role ... KW - aco KW - scheduling AU - van der Zwaan, S AU - Marques, C PY - 1999/// UR - http://citeseer.ist.psu.edu/vanderzwaan99ant.html ER -