Busy time scheduling on a bounded number of machines (extended abstract)

DOI10.1007/978-3-319-62127-2_44zbMath1491.90085OpenAlexW2726686740MaRDI QIDQ2405306

Frederic Koehler, Samir Khuller

Publication date: 22 September 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62127-2_44

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Minimum hitting set of interval bundles problem: computational complexity and approximability ⋮ Active and Busy Time Scheduling Problem: A Survey

This page was built for publication: Busy time scheduling on a bounded number of machines (extended abstract)