Minimizing the maximum flow time in batch scheduling

DOI10.1016/j.orl.2016.09.016zbMath1408.90131OpenAlexW2528912916MaRDI QIDQ1709967

Sungjin Im, Hoon Oh, Maryam Shadloo

Publication date: 15 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.09.016

zbMATH Keywords

approximationbatch schedulingresource augmentationbroadcast schedulingmaximum flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• New Models and Algorithms for Throughput Maximization in Broadcast Scheduling
• Broadcast scheduling
• Speed is as powerful as clairvoyance
• Throughput maximization of real-time scheduling with batching
• New Approximations for Broadcast Scheduling via Variants of α-point Rounding
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach

This page was built for publication: Minimizing the maximum flow time in batch scheduling