By Topic

A Modified Genetic Algorithm to Due Date of Job Shop Scheduling Problem

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)
Chuanjun Zhu ; Dept. of Mech. Eng., Hubei Automotive Ind. Inst., Shiyan, China ; Yurong Chen ; Chaoyong Zhang

This paper presents a modified genetic search algorithm for the non-regular job-shop scheduling problem with due date. The chromosome representation of the problem is based on the operation-based representation. In order to reduce the search space, the procedure for generating active schedules is constructed. For avoiding premature convergence in the conventional genetic algorithms (GA), the precedence operation crossover (POX) and approach of the generation alteration model are presented. The algorithm is tested on the instances for due date, the computation results validate the effectiveness of the proposed algorithm.

Published in:

Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on

Date of Conference:

18-20 Jan. 2009