By Topic

Fuzzy scheduling for 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

3 Author(s)
Ba-yi Cheng ; Dept. of Inf. Manage. & Decision Sci., Univ. of Sci. & Technol. of China, Hefei ; Hua-Ping Chen ; Shuan-shi Wang

In this paper, we introduce the fuzzy model of the makespan on a single batch-processing machine with non-identical job sizes and propose an improved DNA evolutionary algorithm (IDEA) solution approach. The model is based on fuzzy batch processing time and fuzzy intervals between batches. DEA is improved by integrating the crossover operator to overcome the immature convergence caused by the determinate selection of vertical operator in DEA. To decode the permutations of jobs searched by IDEA, the heuristic first fit decreasing (FFD) is applied to produce batches. In the experiment, the results of the fuzzy makespan demonstrate the proposed algorithm outperforms GA and SA on all instances.

Published in:

Fuzzy Systems, 2008. FUZZ-IEEE 2008. (IEEE World Congress on Computational Intelligence). IEEE International Conference on

Date of Conference:

1-6 June 2008