Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

DOI10.1016/j.cor.2013.01.019zbMath1348.90319OpenAlexW2017841433MaRDI QIDQ336376

Mariona Vilà, Jordi Pereira

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.019

zbMATH Keywords

schedulingdynamic programmingsingle machineassignment problemtime-indexed formulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Single machine scheduling problem with interval processing times to minimize mean weighted completion time ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ The single machine weighted mean squared deviation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• On single-machine scheduling without intermediate delays
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A time indexed formulation of non-preemptive single machine scheduling problems
• Single machine earliness and tardiness scheduling
• Minimizing the weighted sum of squared tardiness on a single machine
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• The one-machine problem with earliness and tardiness penalties
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• Time-Indexed Formulations and the Total Weighted Tardiness Problem
• A Dynamic Programming Approach to Sequencing Problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• Assignment Problems
• Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
• The Single Machine Early/Tardy Problem
• Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
• Minimizing Total Costs in One-Machine Scheduling
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• The Schedule-Sequencing Problem