Approximation Algorithms for Scheduling Parallel Jobs
From MaRDI portal
Publication:5390607
DOI10.1137/080736491zbMath1209.68064OpenAlexW2048462504MaRDI QIDQ5390607
Publication date: 4 April 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080736491
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (17)
Scheduling under the network of temporo-spatial proximity relationships ⋮ A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds ⋮ A \((5/3+\varepsilon)\)-approximation for strip packing ⋮ Peak demand minimization via sliced strip packing ⋮ Malleable scheduling beyond identical machines ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ Unnamed Item ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ Improved approximation for two dimensional strip packing with polynomial bounded width ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Bounding the Running Time of Algorithms for Scheduling and Packing Problems ⋮ Approximation algorithms for two-stage flexible flow shop scheduling ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing ⋮ Online scheduling of moldable parallel tasks ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
This page was built for publication: Approximation Algorithms for Scheduling Parallel Jobs
