A new algorithm for online uniform-machine scheduling to minimize the makespan
From MaRDI portal
Publication:845691
DOI10.1016/j.ipl.2006.02.012zbMath1184.68120OpenAlexW2057768782MaRDI QIDQ845691
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/474
Related Items (7)
A survey on makespan minimization in semi-online environments ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ Competitive ratio of list scheduling on uniform machines and randomized heuristics ⋮ General parametric scheme for the online uniform machine scheduling problem with two different speeds ⋮ On the optimality of list scheduling for online uniform machines scheduling ⋮ Online Scheduling on a CPU-GPU Cluster ⋮ Online scheduling on three uniform machines
Cites Work
This page was built for publication: A new algorithm for online uniform-machine scheduling to minimize the makespan
