Ideal preemptive schedules on two processors

DOI10.1007/S00236-003-0119-6zbMath1060.68014OpenAlexW2090947986MaRDI QIDQ1424363

Jay Sethuraman, Timkovsky, Vadim G., Edward G. jun. Coffman

Publication date: 11 March 2004

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-003-0119-6

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Normal-form preemption sequences for an open problem in scheduling theory ⋮ A new polynomial algorithm for a parallel identical scheduling problem ⋮ Minimizing total completion time for UET tasks with release time and outtree precedence constraints ⋮ PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES ⋮ Ideal schedules in parallel machine settings ⋮ Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time ⋮ An efficient algorithm for finding ideal schedules ⋮ How small are shifts required in optimal preemptive schedules?

This page was built for publication: Ideal preemptive schedules on two processors