Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine

DOI10.1007/978-3-319-42634-1_39zbMath1476.90117OpenAlexW2405489020MaRDI QIDQ2817891

Pierre-Francois Dutot, Erik Saule, Abhinav Srivastav, Denis Trystram

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hal.univ-grenoble-alpes.fr/hal-01309052/file/full-proof-copy.pdf

Mathematics Subject Classification ID

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

Related Items (1)

Improved lower bounds for online scheduling to minimize total stretch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
• On-line scheduling to minimize average completion time revisited.
• Minimizing the stretch when scheduling flows of divisible requests
• A class of on-line scheduling algorithms to minimize total completion time
• All-Norms and All-L_p-Norms Approximation Algorithms
• Server scheduling in the L _p norm

This page was built for publication: Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine