Scheduling with periodic availability constraints and irregular cost functions
From MaRDI portal
Publication:3598681
DOI10.1051/ro:2007016zbMath1154.90489MaRDI QIDQ3598681
Publication date: 3 February 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105366
90B35: Deterministic scheduling theory in operations research
Uses Software
Cites Work
- A study of the cyclic scheduling problem on parallel processors
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
- Optimal timing of a sequence of tasks with general completion costs
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- A framework for the complexity of high-multiplicity scheduling problems
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- High Multiplicity in Earliness-Tardiness Scheduling