Optimal on-line flow time with resource augmentation

DOI10.1016/j.dam.2005.05.016zbMath1125.90016OpenAlexW2099303310MaRDI QIDQ2489955

Rob van Stee, Leah Epstein

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.016

zbMATH Keywords

SchedulingOn-line algorithmsResource augmentationFlow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Minimizing the maximum flow time in the online food delivery problem ⋮ Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines ⋮ From Preemptive to Non-preemptive Scheduling Using Rejections

Cites Work

• Scheduling data transfers in a network and the set scheduling problem
• Minimizing the flow time without migration
• Optimal on-line algorithms for single-machine scheduling
• Optimal time-critical scheduling via resource augmentation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal on-line flow time with resource augmentation