Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

DOI10.1145/1008731.1008732zbMath1204.90035OpenAlexW2007568515MaRDI QIDQ3069900

Luca Becchetti, Stefano Leonardi

Publication date: 1 February 2011

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

parallel machinesrandomized multilevel feedback algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Approximating total flow time on parallel machines ⋮ Greedy scheduling with custom-made objectives ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ An Optimal Strategy for Online Non-uniform Length Order Scheduling ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Achievable Performance of Blind Policies in Heavy Traffic ⋮ Non-clairvoyantly scheduling to minimize convex functions

This page was built for publication: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines