Max-min Online Allocations with a Reordering Buffer

DOI10.1137/100794006zbMath1235.68326OpenAlexW2093065103MaRDI QIDQ5895538

Leah Epstein, Rob van Stee, Asaf Levin

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://edoc.mpg.de/618647

zbMATH Keywords

schedulinganalysiscompetitivesemi-online algorithmsmax-min allocations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (10)

Improved approaches to the exact solution of the machine covering problem ⋮ Semi-online scheduling: a survey ⋮ Machine covering in the random-order model ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ Online makespan scheduling with job migration on uniform machines

This page was built for publication: Max-min Online Allocations with a Reordering Buffer