Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
Authors:
- 9 December 2014
- journal article
- Published by Springer Nature in Operational Research
- Vol. 15 (1) , 95-114
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardinessInternational Journal of Production Research, 2013
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardinessComputers & Operations Research, 2010
- Permutation flowshop scheduling problems with maximal and minimal time lagsComputers & Operations Research, 2006
- Scheduling operations for the harvesting of renewable resourcesJournal of Food Engineering, 2005
- Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-HardJournal of Scheduling, 2004
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costsNaval Research Logistics (NRL), 2004
- Single machine scheduling with chain: structured precedence constraints and separation time windowsIEEE Transactions on Robotics and Automation, 1996
- Shop Problems With Two Machines and Time LagsOperations Research, 1996
- Scheduling products with bills of materials using an improved Lagrangian relaxation techniqueIEEE Transactions on Robotics and Automation, 1994
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979