Preemptive scheduling with dedicated processors: applications of fractional graph coloring

DOI10.1023/B:JOSH.0000013054.30334.b9zbMath1154.90463OpenAlexW2618183731MaRDI QIDQ5920389

Lorant Porkolab, Klaus Jansen

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:josh.0000013054.30334.b9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion

This page was built for publication: Preemptive scheduling with dedicated processors: applications of fractional graph coloring