Cost-efficient Scheduling on Machines from the Cloud
Alexander M\"acker, Manuel Malatyali, Friedhelm Meyer auf der Heide,, S\"oren Riechers

TL;DR
This paper presents an online scheduling algorithm for cloud-based machine rental that minimizes costs while meeting job deadlines, considering machine setup times, job slack, and machine-type costs.
Contribution
It introduces an $O(rac{c}{ ext{ps}} + rac{1}{ ext{ps}^3})$-competitive algorithm for scheduling with slack ps, addressing the impact of setup times and machine costs.
Findings
Achieves competitive ratio depending on setup time and machine costs.
Provides a lower bound matching the upper bound's dependence on parameters.
Shows finite competitiveness only when slack exceeds a certain threshold.
Abstract
We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at…
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
