Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- 31 January 2010
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 37 (1), 189-198
- https://doi.org/10.1016/j.cor.2009.04.008
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problemEuropean Journal of Operational Research, 2008
- Modeling realistic hybrid flexible flowshop scheduling problemsComputers & Operations Research, 2008
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine schedulingComputers & Operations Research, 2007
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion timeComputers & Operations Research, 2006
- An alternative framework to Lagrangian relaxation approach for job shop schedulingEuropean Journal of Operational Research, 2003
- A branch-and-bound algorithm for the hybrid flowshopInternational Journal of Production Economics, 2000
- An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming methodIEEE Transactions on Robotics and Automation, 1998
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion timeInternational Journal of Production Research, 1996
- A practical approach to job-shop scheduling problemsIEEE Transactions on Robotics and Automation, 1993
- Schedule generation and reconfiguration for parallel machinesIEEE Transactions on Robotics and Automation, 1990