The single machine weighted mean squared deviation problem
From MaRDI portal
Recommendations
- Minimizing weighted mean absolute deviation of flow times in single machine systems
- Minimizing the weighted sum of squared tardiness on a single machine
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- A quadratic integer programming method for minimizing the mean squared deviation of completion times
Cites work
- A differential evolution approach for the common due date early/tardy job scheduling problem
- A half-product based approximation scheme for agreeably weighted completion time variance
- A lower bound for weighted completion time variance
- A survey on scheduling problems with due windows
- A time indexed formulation of non-preemptive single machine scheduling problems
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- An experimental and analytical study of order constraints for single machine scheduling with quadratic cost
- Column Generation
- Completion time variance minimization on a single machine is difficult
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- For the airplane refueling problem local precedence implies global precedence
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Mimimization of agreeably weighted variance in single machine systems
- Minimization of half-products
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Single-Machine Completion Time Variance
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Minimizing the average deviation of job completion times about a common due date
- New exact algorithms for one-machine earliness-tardiness scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling about a given common due date to minimize mean squared deviation of completion times
- Scheduling. Theory, algorithms, and systems.
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
- Time-indexed formulations and the total weighted tardiness problem
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(7)- The TV advertisements scheduling problem
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
- On the local dominance properties in single machine scheduling problems
- A branch and price algorithm for single-machine completion time variance
- On The Relations Between Optimal Solutions For Different Types OfMin-SumBalanced Jit Optimisation Problems
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
This page was built for publication: The single machine weighted mean squared deviation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753598)
