By Topic

A Novel Differential Evolution Algorithm for 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)
Wen-Gong Zhang ; Dept. of Inf. Manage. & Decision Sci., Univ. of Sci. & Technol. of China, Hefei ; Hua-Ping Chen ; Di Lu ; Hao Shao

This paper proposes a novel differential evolution algorithm approach to minimize makespan for a single batch-processing machine with non-identical job sizes. Batch processing machines can process all the jobs in a batch simultaneously. The processing times and the sizes of the jobs are known. The machine can process a batch as long as its capacity is not exceeded. The processing time of a batch is the longest processing time of all the jobs in that batch. According to the discrete characteristic of the problem, an iterative model with new operations is designed for the proposed algorithm. It is simple to implement and is suitable for discrete problems, especially for scheduling batch-processing machine problems with non-identical job sizes. The computational results show that the proposed algorithm is effective compare to the algorithms in the literature.

Published in:

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

Date of Conference:

18-20 Oct. 2008