Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling

DOI10.1287/moor.2021.1149zbMath1479.90110OpenAlexW3184084661MaRDI QIDQ4958564

Marc Uetz, Benjamin Moseley, Varun Gupta, Qiaomin Xie

Publication date: 14 September 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2021.1149

zbMATH Keywords

release timesonline algorithmdeterministic schedulingunrelated machinestotal weighted completion time

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

An improved greedy algorithm for stochastic online scheduling on unrelated machines

Cites Work

• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling

This page was built for publication: Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling