1. An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes.
- Author
-
Cheng, Bayi, Wang, Qi, Yang, Shanlin, and Hu, Xiaoxuan
- Subjects
MATHEMATICAL optimization ,COMPUTER scheduling ,ARBITRARY constants ,INTEGER programming ,COMPUTATIONAL complexity ,PERFORMANCE evaluation ,ALGORITHMS - Abstract
Abstract: In this paper we consider the problem of scheduling parallel batching machines with jobs of arbitrary sizes. The machines have identical capacity of size and processing velocity. The jobs are processed in batches given that the total size of jobs in a batch cannot exceed the machine capacity. Once a batch starts processing, no interruption is allowed until all the jobs are completed. First we present a mixed integer programming model of the problem. We show the computational complexity of the problem and optimality properties. Then we propose a novel ant colony optimization method where the Metropolis Criterion is used to select the paths of ants to overcome the immature convergence. Finally, we generate different scales of instances to test the performance. The computational results show the effectiveness of the algorithm, especially for large-scale instances. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF