A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
- 30 November 1992
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 19 (8) , 757-766
- https://doi.org/10.1016/0305-0548(92)90015-w
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal common due-date with limited completion timeComputers & Operations Research, 1991
- CON due-date determination and sequencingComputers & Operations Research, 1990
- A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problemComputers & Operations Research, 1990
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Single-machine scheduling to minimize absolute deviation of completion times from a common due dateNaval Research Logistics (NRL), 1989
- The Single Machine Early/Tardy ProblemManagement Science, 1989
- Optimal common due-date with limited completion time deviationComputers & Operations Research, 1988
- Determination of an optimal common due date and optimal sequence in a single machine job shopInternational Journal of Production Research, 1988
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981
- Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1977