Scheduling about a given common due date to minimize mean squared deviation of completion times
From MaRDI portal
Publication:1266598
DOI10.1016/0377-2217(94)00195-2zbMath0913.90186OpenAlexW2070954696MaRDI QIDQ1266598
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00195-2
Related Items (5)
Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ The single machine weighted mean squared deviation problem ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Cites Work
- Scheduling about a common due date with earliness and tardiness penalties
- Proof of a conjecture of Schrage about the completion time variance problem
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Variation of Flow Time in Single Machine Systems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing Single-Machine Completion Time Variance
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing the Flow-time Variance in Single-machine Systems
- Variance Minimization in Single Machine Sequencing Problems
This page was built for publication: Scheduling about a given common due date to minimize mean squared deviation of completion times