Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4634318 | Applied Mathematics and Computation | 2008 | 12 Pages |
Abstract
This paper seeks to explore the effectiveness of ant colony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the workload of jobs. The performances of the proposed two ant-colony algorithms are evaluated based on integer programming and simulated annealing solutions. Results show that the ant-colony algorithm implementation is able to compete effectively with the best known solution to the problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Serap Ulusam Seçkiner, Mustafa Kurt,