Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- 1 October 1989
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 36 (5) , 663-673
- https://doi.org/10.1002/1520-6750(198910)36:5<663::aid-nav3220360510>3.0.co;2-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Scheduling to a common due date on parallel uniform processorsNaval 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 the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981