Equivalence of mean flow time problems and mean absolute deviation problems
Authors:
- 1 November 1990
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 9 (6) , 371-374
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- One-Processor Scheduling with Symmetric Earliness and Tardiness PenaltiesMathematics of Operations Research, 1988
- 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
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956