A chaotic Ant Colony Optimization method for scheduling a single batch-processing machine with non-identical job sizes
The problem of minimizing makespan on a single batch-processing machine with non-identical job sizes is strongly NP-hard. This paper proposes an ant colony optimization (ACO) algorithm with chaotic control to solve the problem. The metropolis criterion is adopted to select the paths of ants to escap...
Saved in:
Published in | 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) pp. 40 - 43 |
---|---|
Main Authors | , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.06.2008
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!