Equivalence of mean flow time problems and mean absolute deviation problems
From MaRDI portal
Publication:1173904
DOI10.1016/0167-6377(90)90056-BzbMath0825.90553OpenAlexW2067228699MaRDI QIDQ1173904
Publication date: 25 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(90)90056-b
Related Items (16)
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ Simultaneous minimization of total completion time and total deviation of job completion times ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain ⋮ Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties ⋮ Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ Due-date assignment on uniform machines ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ Parallel machine earliness and tardiness scheduling with proportional weights
Cites Work
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Equivalence of mean flow time problems and mean absolute deviation problems
