Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
From MaRDI portal
Publication:1044134
DOI10.1016/j.ejor.2009.02.005zbMath1177.90152MaRDI QIDQ1044134
David Rivreau, Éric Pinson, Boris Detienne
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.02.005
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Preemption in single machine earliness/tardiness scheduling
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- An improved earliness--tardiness timing algorithm
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Adjustment of heads and tails for the job-shop problem
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Machine scheduling with earliness, tardiness and non-execution penalties
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- The one-machine problem with earliness and tardiness penalties
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Minimizing the earliness--tardiness costs on a single machine
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- An Algorithm for Solving the Job-Shop Problem
- Ordonnancements à contraintes disjonctives
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Validation of subgradient optimization
- Principles and Practice of Constraint Programming – CP 2004
