By Topic

Decomposition heuristics for robust job-shop scheduling

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)
Eni-Seok Byeon ; Korea Transp. Inst., Seoul, South Korea ; Wu, S.D. ; Storer, R.H.

In this paper, we present an approach to weighted tardiness job-shop scheduling problems (JSP) using a graph decomposition technique. Our method decomposes a JSP into a series of sub-problems by solving a variant of the generalized assignment problem which we term “VAP”. Given a specified assignment cost, VAP assigns operations to mutually exclusive and exhaustive subsets, identifying a partially specified schedule, Compared to a conventional, completely specified schedule, this partial schedule is more robust to shop disturbances, and therefore more useful for planning and control. We have developed assignment heuristics which iteratively update the problem parameters using lower and upper bounds computed from the corresponding schedule. The heuristics are tested on standard test problems. We show that the proposed approach provides a means for extending traditional scheduling capabilities to a much wider spectrum of shop conditions and production scenarios

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:14 ,  Issue: 2 )