By Topic

A partial-clustering based algorithm for iterative partial-decomposition of large scale job shops scheduling problems

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

4 Author(s)
Yun-Dong Gu ; School of Mathematics and physics, North China Electric Power University, Beijing, 102206, China ; De-Gang Chen ; Guo-Dong Li ; Min Liu

For large scale scheduling problems, the iterative decomposition is a feasible approach to reduce the size of problems. A partial clustering based algorithm is proposed for the iterative partial decomposition of large-scale scheduling problems in this paper. The efficiency of the new method is illustrated by numerical computational results on several large-scale production scheduling problems.

Published in:

2009 International Conference on Machine Learning and Cybernetics  (Volume:4 )

Date of Conference:

12-15 July 2009