Minimizing the Flow Time Without Migration

DOI10.1137/S009753970037446XzbMath1051.68072OpenAlexW2037502715MaRDI QIDQ3149872

Baruch Awerbuch, Stefano Leonardi, Yossi Azar, Oded Regev

Publication date: 29 September 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753970037446x

zbMATH Keywords

schedulingapproximationmigrationonlineflow time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (5)

Approximating total flow time on parallel machines ⋮ Improved lower bounds for online scheduling to minimize total stretch ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Reallocation problems in scheduling ⋮ Non-clairvoyantly scheduling to minimize convex functions

This page was built for publication: Minimizing the Flow Time Without Migration