By Topic

A new Lagrangian Relaxation based method to improve schedule quality

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)
Yu, D. ; Dept. of Electr. & Comput. Eng., Connecticut Univ., Storrs, CT, USA ; Luh, P.B. ; Soorapanth, S.

Lagrangian Relaxation (LR) bas been used for manufacturing scheduling with good results. For practical applications, the method, however, may suffer from slow convergence, and may not be able to generate good results within a required CPU time. To improve convergence and solution quality, a new augmented LR method is presented in this paper where additional penalty terms associated with constraint violation is added to the objective function. To overcome the inseparability difficulty caused by the penalty term, a surrogate subgradient direction is used to update the multipliers and to guarantee solvability and convergence. Numerical testing results demonstrate that compared with the standard LR method, the augmented LR method is computationally efficient, and generates good schedules with reduced cost.

Published in:

Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings. 2003 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference:

27-31 Oct. 2003