Algorithms – ESA 2005

DOI10.1007/11561071zbMATH Open1162.90466OpenAlexW2501059503MaRDI QIDQ5475868FDOQ5475868

Hadas Shachnai, Tami Tamir, Jiří Sgall

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Recommendations

• Periodic scheduling with obligatory vacations
• Scheduling jobs that arrive over time
• Nearly optimal perfectly-periodic schedules
• Approximation algorithms for scheduling with reservations
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cited In (1)

• Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements

This page was built for publication: Algorithms – ESA 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475868)