Minimizing mean absolute deviation of completion times about a common due date
Authors:
- 1 May 1986
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 33 (2) , 227-240
Abstract
We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold. We also establish the similarity of this problem to the two parallel machines mean flow time problem.Keywords
This publication has 7 references indexed in Scilit:
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984
- Minimizing Variation of Flow Time in Single Machine SystemsManagement Science, 1981
- 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
- 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