Scheduling about a common due date with earliness and tardiness penalties
- 31 December 1990
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 17 (2), 231-241
- https://doi.org/10.1016/0305-0548(90)90046-a
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Minimizing Weighted Absolute Deviation in Single Machine SchedulingIIE Transactions, 1987
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due dateNaval Research Logistics (NRL), 1987
- Minimizing mean absolute deviation of completion times about a common due dateNaval Research Logistics Quarterly, 1986
- Single‐ and multiple‐processor models for minimizing completion time varianceNaval Research Logistics Quarterly, 1986
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984
- Minimizing a quadratic function of job lateness on a single machineEngineering Costs and Production Economics, 1983
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling ProblemOperations Research, 1982
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1978
- Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1977