Non-Preemptive Flow-Time Minimization via Rejections

DOI10.4230/LIPIcs.ICALP.2018.70zbMath1499.90074arXiv1805.09602OpenAlexW2963296836MaRDI QIDQ5002748

Amit Kumar, Anupam Gupta, Jason Li

Publication date: 28 July 2021

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

zbMATH Keywords

schedulingunrelated machinesrejectionnon-preemptive

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
• Rejecting jobs to minimize load and maximum flow-time
• Approximating total flow time on parallel machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
• Speed is as powerful as clairvoyance
• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• Multiprocessor Scheduling with Rejection
• A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
• Algorithms - ESA 2003

This page was built for publication: Non-Preemptive Flow-Time Minimization via Rejections