A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- 1 November 2006
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 33 (11), 3344-3359
- https://doi.org/10.1016/j.cor.2005.03.028
Abstract
No abstract availableFunding Information
- Fok Ying Tung Education Foundation
- National Natural Science Foundation of China (60274049, 70171030, 70425003)
- Ministry of Education of the People's Republic of China
This publication has 16 references indexed in Scilit:
- Heuristics for hybrid flow shops with controllable processing times and assignable due datesComputers & Operations Research, 2002
- Steel-making process scheduling using Lagrangian relaxationInternational Journal of Production Research, 2002
- Heuristics for minimizing total weighted tardiness in flexible flow shopsJournal of Scheduling, 2000
- Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum latenessInternational Journal of Production Economics, 2000
- A branch-and-bound algorithm for the hybrid flowshopInternational Journal of Production Economics, 2000
- Hybrid flow shop scheduling: A surveyComputers & Industrial Engineering, 1999
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stageAnnals of Operations Research, 1997
- A practical approach to job-shop scheduling problemsIEEE Transactions on Robotics and Automation, 1993
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier BV ,1977