Improved Scheduling with a Shared Resource
Christoph Damerius, Peter Kling, Florian Schneider

TL;DR
This paper presents new algorithms for shared-resource scheduling, achieving optimal competitive ratios for makespan minimization and improved approximation factors for total completion time, in both online and fractional settings.
Contribution
It introduces an optimal online algorithm for makespan minimization and a better approximation algorithm for total completion time using CLP and geometric analysis.
Findings
Optimal $e/(e-1)$-competitive algorithm for online makespan minimization.
A $(3/2+ ext{epsilon})$-approximation for total completion time.
Improved approximation factor from 2 to 1.5+epsilon for fractional total completion time.
Abstract
We consider the following shared-resource scheduling problem: Given a set of jobs , for each we must schedule a job-specific processing volume of . A total resource of is available at any time. Jobs have a resource requirement , and the resources assigned to them may vary over time. However, assigning them less will cause a proportional slowdown. We consider two settings. In the first, we seek to minimize the makespan in an online setting: The resource assignment of a job must be fixed before the next job arrives. Here we give an optimal -competitive algorithm with runtime . In the second, we aim to minimize the total completion time. We use a continuous linear programming (CLP) formulation for the fractional total completion time and combine it with a previously known dominance property from malleable job…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Scheduling and Optimization Algorithms · Advanced Bandit Algorithms Research
