Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- 1 October 1987
- journal article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 34 (5), 739-751
- https://doi.org/10.1002/1520-6750(198710)34:5<739::aid-nav3220340513>3.0.co;2-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Minimizing mean absolute deviation of completion times about a common due dateNaval Research Logistics Quarterly, 1986
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984
- 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
- Minimising Waiting Time Variance in the Single Machine ProblemManagement Science, 1977
- Minimizing the Time-in-System Variance for a Finite JobsetManagement Science, 1975
- Variance Minimization in Single Machine Sequencing ProblemsManagement Science, 1972