An Analysis of Preemptive Multiprocessor Job Scheduling

DOI10.1287/MOOR.5.3.415MaRDI QIDQ3885494zbMATH OpenOpenAlexFDO

Authors 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

least finishing timepartially ordered set of tasksperformancepreemptive multiprocessor job schedulingpreemptive schedulingscheduling heuristicworst case performance bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(3)

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

This page was built for publication: An Analysis of Preemptive Multiprocessor Job Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885494)