By Topic

Minimizing Makespan for Single Batch Processing Machine with Non-identical Job Sizes Using a Novel Algorithm: Free Search

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)
Ya-ling Zhang ; Dept. of Inf. Manage. & Decision Sci., USTC, Hefei, China ; Hua-Ping Chen ; Hao Shao ; Rui Xu

A novel algorithm called free search (FS) is applied to solve the scheduling problems on a single batch processing machine with non-identical job sizes (NSBM) in this paper. The concept of sensibility was introduced in FS, with which the algorithm had no restriction of the probability to zero for the parts of the search space and thus it could avoid premature convergence. In order to make it feasible to NSBM problem, we modify the parameters settings and also provide coding by vector method which makes FS proper to discrete problem. Then the algorithm of batching based FS (BFS) is proposed. In the experiment, all levels of instances are simulated and the results show that BFS has better performance on global search and outperforms other algorithm in the literature.

Published in:

Information Technology and Computer Science, 2009. ITCS 2009. International Conference on  (Volume:1 )

Date of Conference:

25-26 July 2009