Improved scheduling with a shared resource
From MaRDI portal
Publication:6606174
DOI10.1007/978-3-031-49611-0_11MaRDI QIDQ6606174
Christoph Damerius, Florian Schneider, Peter Kling
Publication date: 16 September 2024
list schedulingapproximation algorithmmakespancompletion timecontinuous linear programmalleable job scheduling
Cites Work
- Title not available (Why is that?)
- Continuous speed scaling with variability: a simple and direct approach
- Machine scheduling with resource dependent processing times
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- Scheduling shared continuous resources on many-cores
- Scheduling with an orthogonal resource constraint
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- Improved scheduling with a shared resource via structural insights
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- New applications of the Muntz and Coffman algorithm
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)
