By Topic

A batch splitting job shop scheduling problem with bounded batch sizes under multiple-resource constraints using genetic algorithm

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)
Hai-Yan Wang ; Key Lab. of Mech. Manuf. & Autom. of Minist. of Educ., Zhejiang Univ. of Technol., Hangzhou ; Yan-Wei Zhao ; Xin-li Xu ; Wan-Liang Wang

Considering alternative resources for operations, requirement of multiple resources to process an operation and a jobpsilas batch size greater than one in the real manufacturing environment, a study is made on the batch splitting scheduling problem with bounded batch sizes under multiple-resource constraints, based on the objective to minimize the maximum completion time. A genetic algorithm which is suitable for this problem is proposed, with a new chromosome representation, which takes into account the batch splitting of the original batches of jobs. And a new crossover method and a new mutation method are proposed based on the new chromosome representation. The results of the simulation indicate that the method is feasible and efficient.

Published in:

Cybernetics and Intelligent Systems, 2008 IEEE Conference on

Date of Conference:

21-24 Sept. 2008