Speed-robust scheduling: sand, bricks, and rocks

@article{Eberle2020SpeedrobustSS,
title={Speed-robust scheduling: sand, bricks, and rocks},
author={Franziska Eberle and Ruben Hoeksma and Nicole Megow and Lukas N{\"o}lke and Kevin Schewior and Bertrand Simon},
journal={Mathematical Programming},
year={2020},
volume={197},
pages={1009 - 1048}
}
• Published 10 November 2020
• Geology
• Mathematical Programming
The speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be grouped into at most m bags while the processing speeds of the machines are unknown. After the speeds are revealed, the grouped jobs must be assigned to the machines without being separated. To evaluate the performance of algorithms, we determine upper bounds on the worst-case ratio of the algorithm’s makespan and the optimal makespan given full information. We refer to this ratio as the robustness…
• Computer Science
ArXiv
• 2022
This paper studies the speed-robust scheduling problem where the speeds of the machines, instead of the processing times of the jobs, are unknown and develops an algorithm that achieves a min { η 2 (1+ α ) , (2+2 /α ) } approximation, for any α ∈ (0, 1) , where η ≥ 1 is the prediction error.
• Computer Science
ArXiv
• 2023
This work considers online scheduling on unrelated (heterogeneous) machines in a speed-oblivious setting, where an algorithm is unaware of the exact job-dependent processing speeds, and provides competitive algorithms for the speed-ordered model.

References

SHOWING 1-10 OF 21 REFERENCES

ACM Trans. Algorithms
• 2020
This article introduces the idea of an α-robust algorithm, one that is guaranteed to return a schedule on any number m of machines that is within an α factor of the optimal schedule on m machine, where the optimum is not subject to the restriction that the sets cannot be separated.
• Computer Science
Algorithmica
• 2016
It is shown that any algorithm that achieves a competitiveness smaller than 4 / 3 must construct $$\Omega (m)$$Ω(m) schedules", and that the competitive ratios achieved using parallel schedules are considerably smaller than those in the standard problem without resource augmentation.
• K. Jansen
• Computer Science
SIAM J. Discret. Math.
• 2009
The algorithm, based on a new mixed integer linear programming (MILP) formulation with a constant number of integral variables and an interesting rounding method, finds a schedule whose length is within a relative error *** of the optimum, and has running time 2 O(1/\epsilon^2) poly(n).
Annals of Operations Research
• 2021
We consider a natural generalization of classical scheduling problems to a setting in which using a time unit for processing a job causes some time-dependent cost, the time-of-use tariff, which must
• Computer Science
IPCO
• 2007
Surprisingly, it is shown that for this generalization of the problem of finding the maximum-weight subset of jobs that can be scheduled on one machine where each job is constrained to be processed within a specified time window, the same performance guarantee that is obtained for the deterministic case can be obtained for its stochastic extension.
• Computer Science
26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
• 1985
A new approach to constructing approximation algorithms, which the aim is find superoptimal, but infeasible solutions, and the performance is measured by the degree of infeasibility allowed, which should find wide applicability for any optimization problem where traditional approximation algorithms have been particularly elusive.
A unified and practical approach has been developed to design and analyze (nearly) opt imal olicies across the range of stochastic scheduling models, and model assumptions vary across several dimensi ons.
Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
• Computer Science
Encyclopedia of Algorithms
• 2012
This work designs a deterministic algorithm that finds a universal scheduling sequence with a solution value within 4 times the value of an optimal clairvoyant algorithm that knows the machine behavior in advance and presents a nontrivial algorithm with a small constant performance guarantee.