Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
From MaRDI portal
Publication:4909524
DOI10.1007/978-3-642-35261-4_11zbMath1260.68473arXiv1309.5697OpenAlexW1885866089MaRDI QIDQ4909524
Mong-Jen Kao, Dorothea Wagner, Ignaz Rutter, Jian-Jia Chen
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5697
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Online scheduling of time-critical tasks to minimize the number of calibrations, Efficient algorithms for scheduling parallel jobs with interval constraints in clouds, Online machine minimization with lookahead, An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization, An improved algorithm for online machine minimization, Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints, Online dynamic power management with hard real-time guarantees