Online scheduling of two uniform machines to minimize total completion times

DOI10.3934/jimo.2009.5.95zbMath1158.90351OpenAlexW1991904566MaRDI QIDQ1013450

Peihai Liu, Xi-wen Lu

Publication date: 20 April 2009

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2009.5.95

zbMATH Keywords

schedulingcompetitive ratioonline algorithmuniform machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time ⋮ Randomized mechanism design for decentralized network scheduling ⋮ Online scheduling to minimize modified total tardiness with an availability constraint ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling

This page was built for publication: Online scheduling of two uniform machines to minimize total completion times