Dynamising Interval Scheduling: The Monotonic Case

DOI10.1007/978-3-642-45278-9_16MaRDI QIDQ2870026zbMATH OpenOpenAlexFDO

Authors Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu, Alexander Gavryushkin

Publication date 17 January 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_16

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Data structures (68P05)

Recommendations

• Dynamic algorithms for monotonic interval scheduling problem
• scientific article; zbMATH DE number 1946760
• Rate monotonic scheduling re-analysed
• On the approximability of an interval scheduling problem
• Cycle monotonicity in scheduling models
• Dynamic interval scheduling for multiple machines
• Dynamic problems of scheduling
• An improved approximation algorithm for scheduling monotonic moldable tasks
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• A monotone approximation algorithm for scheduling with precedence constraints

Cited in

(3)

• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
• Dynamic algorithms for monotonic interval scheduling problem
• Dynamic interval scheduling for multiple machines

This page was built for publication: Dynamising Interval Scheduling: The Monotonic Case

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