By Topic

An alternative framework to Lagrangian relaxation approach for 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

2 Author(s)
Haoxun Chen ; Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA ; Luh, P.B.

Lagrangian relaxation (LR) has emerged as a practical approach for complex scheduling problems. The efficiency of the approach, however, depends on how fast the relaxed subproblems and the dual problem are solved. Previously, machine capacity constraints were relaxed and the subproblems were solved by using dynamic programming (DP). The number of multipliers and the computation complexity of the DP algorithm, however, are proportional to the time horizon. This becomes a barrier for the approach to solve problems with long time horizons. The paper presents an alternative framework to overcome the barrier. By using much fewer multipliers to relax operation precedence constraints rather than machine capacity constraints and by approximately solving subproblems, a new LR approach is developed. The approach can find good schedules for problems with thousands of pairs and tens of machines within a short time on a personal computer, making it possible for practical use

Published in:

Decision and Control, 1999. Proceedings of the 38th IEEE Conference on  (Volume:1 )

Date of Conference: