A New Approach to Online Scheduling

DOI10.1145/2996800zbMath1421.68251DBLPjournals/talg/LubbeckeMMW16OpenAlexW1623410360WikidataQ57399723 ScholiaQ57399723MaRDI QIDQ4962651

Elisabeth Lübbecke, Nicole Megow, Andreas Wiese, Olaf Maurer

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2996800

zbMATH Keywords

competitive analysismin-sum objectivejobs arrive over timemakespan, online scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (7)

On competitive analysis for polling systems ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ Select and permute: an improved online framework for scheduling to minimize weighted completion time ⋮ On-line scheduling with monotone subsequence constraints ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling

This page was built for publication: A New Approach to Online Scheduling