Scheduling with conflicts on bipartite and interval graphs

DOI10.1023/A:1022908509269zbMath1154.90460OpenAlexW1513046191MaRDI QIDQ2464395

Sandy Irani, Vitus J. Leung

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/a:1022908509269

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Scheduling with conflicts: Online and offline algorithms ⋮ The interval-merging problem ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths ⋮ The \(p\)-Maxian problem on interval graphs ⋮ Backup 2-center on interval graphs ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs

This page was built for publication: Scheduling with conflicts on bipartite and interval graphs