By Topic

Study and implementation of hybrid scheduling algorithm on JSP

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
$33 $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)
Zang Daxin ; Software Engineering Institute, Beijing University of Aeronautics and Astronautics, Beijing 100083, China ; Yao Jianhua ; Jin Maozhong

This paper analyzes the requirement of a practical job-shop scheduling, which is different from the classical job-shop scheduling problems (JSP), more focus on strict resource constraints. First is formulated a mathematical model. Then described a new method, combined the time Petri net and the hybrid genetic algorithm, to solution of the practical JSP. The time Petri net was used to model discrete events in job shop scheduling, the scheduling results was obtained based on hybrid genetic algorithm. The objective of the new method is obtained makespan minimization in JSP. At the end of the paper, a practical example is described, and the results show that the proposed method is effective.

Published in:

2008 International Conference on Service Systems and Service Management

Date of Conference:

June 30 2008-July 2 2008