Equivalence of mean flow time problems and mean absolute deviation problems
From MaRDI portal
Publication:1173904
DOI10.1016/0167-6377(90)90056-BzbMath0825.90553MaRDI QIDQ1173904
Publication date: 25 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling with Deadlines and Loss Functions
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Minimizing mean absolute deviation of completion times about a common due date
- Single- and multiple-processor models for minimizing completion time variance
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Scheduling independent tasks to reduce mean finishing time