An improved algorithm for online machine minimization

DOI10.1016/J.ORL.2017.11.013OpenAlexW2773026493MaRDI QIDQ2417064

Yossi Azar, Sarel Cohen

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.11.013

zbMATH Keywords

schedulinganalysis of algorithmscompetitive ratioonline machine minimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

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 ⋮ A competitive algorithm for throughput maximization on identical machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Online bin packing with arbitrary release times
• Speed scaling to manage energy and temperature
• Resource Minimization Job Scheduling
• Two-Processor Scheduling with Start-Times and Deadlines
• Some simple scheduling algorithms
• An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization
• An ℴ(log m)-Competitive Algorithm for Online Machine Minimization
• Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem

This page was built for publication: An improved algorithm for online machine minimization