Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines

DOI10.4230/LIPIcs.ESA.2018.59OpenAlexW2963278254MaRDI QIDQ5009625

Abhinav Srivastav, Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Denis Trystram

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1804.08317

zbMATH Keywords

schedulingonline algorithmsresource augmentation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

A best possible online algorithm for minimizing the total completion time and the total soft penalty cost

Cites Work

• Unnamed Item
• Optimal on-line flow time with resource augmentation
• Speed is as powerful as clairvoyance
• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• Minimizing weighted flow time
• Algorithms for minimizing weighted flow time
• Rejecting jobs to Minimize Load and Maximum Flow-time

This page was built for publication: Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines