Optimal on-line flow time with resource augmentation

DOI10.1016/J.DAM.2005.05.016MaRDI QIDQ2489955zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee

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)

Recommendations

• Publication:4782742
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
• Publication:4526977
• Speed is as powerful as clairvoyance
• Optimal time-critical scheduling via resource augmentation

Cites work

• scientific article; zbMATH DE number 1256760 (Why is no real title available?)
• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• Minimizing the flow time without migration
• Optimal on-line algorithms for single-machine scheduling
• Optimal time-critical scheduling via resource augmentation
• Scheduling data transfers in a network and the set scheduling problem

Cited in

(15)

• From preemptive to non-preemptive scheduling using rejections
• Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
• Optimal Online Algorithms for Minimax Resource Scheduling
• Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling
• scientific article; zbMATH DE number 1839473 (Why is no real title available?)
• Competitive Analysis of Scheduling Algorithms for Aggregated Links
• Two-Agent Scheduling with Resource Augmentation on Multiple Machines
• Optimal time-critical scheduling via resource augmentation
• Speed is as powerful as clairvoyance
• scientific article; zbMATH DE number 1947413 (Why is no real title available?)
• Minimizing the maximum flow time in the online food delivery problem
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
• Approximation and Online Algorithms
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489955)