Improved scheduling with a shared resource

DOI10.1007/978-3-031-49611-0_11MaRDI QIDQ6606174zbMATH OpenFDO

Authors Christoph Damerius, Peter Kling, Florian Schneider

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49611-0_11

zbMATH Keywords

approximation algorithmcompletion timecontinuous linear programlist schedulingmakespanmalleable job scheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Continuous speed scaling with variability: a simple and direct approach
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• Improved scheduling with a shared resource via structural insights
• Machine scheduling with resource dependent processing times
• New applications of the Muntz and Coffman algorithm
• Scheduling jobs with time-resource tradeoff via nonlinear programming
• Scheduling shared continuous resources on many-cores
• Scheduling with an orthogonal resource constraint

This page was built for publication: Improved scheduling with a shared resource

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