On the local dominance properties in single machine scheduling problems

DOI10.1007/s10479-023-05801-9zbMATH Open1545.90069MaRDI QIDQ6588484

Oscar C. Vásquez, Natalia Jorquera-Bravo

Publication date: 15 August 2024

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

computational complexitysingle machine scheduling problemsearch spacelocal dominance properties

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Mixed integer formulations using natural variables for single machine scheduling around a common due date
• The TV advertisements scheduling problem
• The single machine weighted mean squared deviation problem
• On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
• Dominance inequalities for scheduling around an unrestrictive common due date
• For the airplane refueling problem local precedence implies global precedence
• The local-global conjecture for scheduling with non-linear cost
• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost

This page was built for publication: On the local dominance properties in single machine scheduling problems