Minimizing total flow time and total completion time with immediate dispatching

DOI10.1007/s00453-006-0193-6zbMath1111.68013OpenAlexW2088810648MaRDI QIDQ878441

Nir Avrahami, Yossi Azar

Publication date: 26 April 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0193-6

zbMATH Keywords

scheduling jobs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (13)

SRPT applied to bandwidth-sharing networks ⋮ Approximating total flow time on parallel machines ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Unnamed Item ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Sleep Management on Multiple Machines for Energy and Flow Time ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Minimizing Average Flow-Time ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Unnamed Item

This page was built for publication: Minimizing total flow time and total completion time with immediate dispatching