An Analysis of Preemptive Multiprocessor Job Scheduling

DOI10.1287/moor.5.3.415zbMath0442.90039OpenAlexW2010152470MaRDI QIDQ3885494

Jeffrey M. Jaffe

Publication date: 1980

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.5.3.415

zbMATH Keywords

performancepreemptive schedulingworst case performance boundsscheduling heuristicleast finishing timepartially ordered set of taskspreemptive multiprocessor job scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Efficient scheduling of tasks without full use of processor resources ⋮ Approximation scheduling algorithms: a survey