Computing optimal preemptive schedules for parallel tasks: linear programming approaches

DOI10.1007/s10107-002-0361-7zbMath1023.90026OpenAlexW2017949344MaRDI QIDQ1396837

Klaus Jansen, Lorant Porkolab

Publication date: 13 July 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0361-7

zbMATH Keywords

linear programmingschedulingmultiprocessormalleable tasks

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES ⋮ Bounding the Running Time of Algorithms for Scheduling and Packing Problems

This page was built for publication: Computing optimal preemptive schedules for parallel tasks: linear programming approaches