scientific article; zbMATH DE number 1383710

zbMath0946.68157MaRDI QIDQ4719334

Piotr Berman, Chris Coulston

Publication date: 4 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

preemptive non-clairvoyant scheduling

Mathematics Subject Classification ID

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

Related Items (6)

Semi-clairvoyant scheduling ⋮ On-line scheduling with tight deadlines. ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Minimizing the maximum starting time on-line ⋮ A tighter extra-resource analysis of online deadline scheduling ⋮ Scheduling in the dark

This page was built for publication: