By Topic

A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rui Xu ; Dept. of Inf. Manage. & Decision Sci., Univ. of Sci. & Technol. of China, Hefei ; Hua-Ping Chen ; Jun-Hong Zhu ; Hao Shao

This paper aims at minimizing the total completion time for a single batch processing machine with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence a chaotic ant colony optimization algorithm based on batch sequence (BCACO) is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that BCACO significantly outperforms other algorithms addressed in the literature.

Published in:

Natural Computation, 2008. ICNC '08. Fourth International Conference on  (Volume:7 )

Date of Conference:

18-20 Oct. 2008