Improving the Lagrangian relaxation approach for large job-shop scheduling
Authors:
- L. FangLFL. Fang
- P.B. LuhPLP.B. Luh
- H. ChanHCH. Chan
- 11 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A macro-level scheduling method using Lagrangian relaxation2003
- Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approachInternational Journal of Production Research, 1999
- An analysis of heuristics in a dynamic job shop with weighted tardiness objectivesInternational Journal of Production Research, 1999
- An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming methodIEEE Transactions on Robotics and Automation, 1998
- An optimization-based algorithm for job shop schedulingSādhanā, 1997
- A practical approach to job-shop scheduling problemsIEEE Transactions on Robotics and Automation, 1993
- Variable target value subgradient methodMathematical Programming, 1990
- Minimization Methods for Non-Differentiable Functions1985
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- Minimization of unsmooth functionalsUSSR Computational Mathematics and Mathematical Physics, 1969