An alternative framework to Lagrangian relaxation approach for job shop scheduling
- 16 September 2003
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 149 (3), 499-512
- https://doi.org/10.1016/s0377-2217(02)00470-8
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Solving Parallel Machine Scheduling Problems by Column GenerationINFORMS Journal on Computing, 1999
- An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming methodIEEE Transactions on Robotics and Automation, 1998
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Chapter 9 Sequencing and scheduling: Algorithms and complexityPublished by Elsevier BV ,1993
- A practical approach to job-shop scheduling problemsIEEE Transactions on Robotics and Automation, 1993
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- A state-of-the-art survey of dispatching rules for manufacturing job shop operationsInternational Journal of Production Research, 1982