Dominance inequalities for scheduling around an unrestrictive common due date
From MaRDI portal
Publication:2242293
DOI10.1016/j.ejor.2021.03.048zbMath1490.90124arXiv2102.07382OpenAlexW3152993497MaRDI QIDQ2242293
Pierre Fouilhoux, Anne-Elisabeth Falq, Safia Kedad-Sidhoum
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07382
Cites Work
- Unnamed Item
- Unnamed Item
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Dominance rules in combinatorial optimization problems
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Mixed integer formulations using natural variables for single machine scheduling around a common due date
- Scheduling around a small common due date
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date 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
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Reducibility among Combinatorial Problems
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
This page was built for publication: Dominance inequalities for scheduling around an unrestrictive common due date