The single machine weighted mean squared deviation problem
From MaRDI portal
Publication:1753598
DOI10.1016/j.ejor.2017.03.001zbMath1403.90358OpenAlexW2594879201MaRDI QIDQ1753598
Jordi Pereira, Oscar C. Vásquez
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.001
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job, The TV advertisements scheduling problem, A branch and price algorithm for single-machine completion time variance, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
Cites Work
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- A lower bound for weighted completion time variance
- A half-product based approximation scheme for agreeably weighted completion time variance
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A differential evolution approach for the common due date early/tardy job scheduling problem
- Mimimization of agreeably weighted variance in single machine systems
- A time indexed formulation of non-preemptive single machine scheduling problems
- Scheduling about a given common due date to minimize mean squared deviation of completion times
- Completion time variance minimization on a single machine is difficult
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- For the airplane refueling problem local precedence implies global precedence
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- A survey on scheduling problems with due windows
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Minimization of Half-Products
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
- Minimizing Single-Machine Completion Time Variance
- An experimental and analytical study of order constraints for single machine scheduling with quadratic cost
- Column Generation
- Variance Minimization in Single Machine Sequencing Problems
- Scheduling
