Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- 4 February 2004
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 51 (3), 407-445
- https://doi.org/10.1002/nav.20000
Abstract
No abstract availableKeywords
Funding Information
- NSF (DMI-0092854)
This publication has 37 references indexed in Scilit:
- Optimization guided lower and upper bounds for the resource investment problemJournal of the Operational Research Society, 2001
- Scheduling jobs and maintenance activities on parallel machinesNaval Research Logistics (NRL), 2000
- A polyhedral approach to single-machine scheduling problemsMathematical Programming, 1999
- Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problemsIIE Transactions, 1998
- An exact algorithm for IP column generationOperations Research Letters, 1996
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problemApplied Mathematical Modelling, 1995
- Scheduling flexible flow shops with no setup effectsIEEE Transactions on Robotics and Automation, 1994
- Equivalence of mean flow time problems and mean absolute deviation problemsOperations Research Letters, 1990
- Heuristic Procedures for Multi-Item Inventory Planning with Limited StorageIIE Transactions, 1990
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984