Balancing perfectly periodic service schedules: An application from recycling and waste management
From MaRDI portal
Publication:3166688
DOI10.1002/nav.21479zbMath1248.91069MaRDI QIDQ3166688
Kathryn E. Stecke, Osman Kazan, Chelliah Skriskandarajah, Milind W. Dawande
Publication date: 15 October 2012
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21479
complexity; approximation algorithms; periodic scheduling; performance bounds; recycling and waste management
90C10: Integer programming
90B50: Management decision making, including multiple objectives
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
91B76: Environmental economics (natural resource models, harvesting, pollution, etc.)
Cites Work
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- A state-of-the-art review of parallel-machine scheduling research
- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
- Performance bounds of algorithms for scheduling advertisements on a web page
- Vehicle minimization for periodic deliveries
- On a periodic maintenance problem
- Minimizing labor requirements in a periodic vehicle loading problem
- Technical Note—Optimal Scheduling of Periodic Activities
- Dispatching in perfectly-periodic schedules
- Bounds on Multiprocessing Timing Anomalies