Ant colony optimization for the job rotation scheduling problem

摘要

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.