Online scheduling to minimize maximum response time and maximum delay factor

DOI10.4086/TOC.2012.V008A007MaRDI QIDQ2913807zbMATH OpenOpenAlexFDO

Authors Chandra Chekuri, Sungjin Im, Benjamin Moseley

Publication date 27 September 2012

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2012.v008a007

zbMATH Keywords

online schedulingresource augmentationbroadcast schedulingmaximum delay factormaximum weighted response time

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
• scientific article; zbMATH DE number 7051282
• Publication:4952666
• Longest wait first for broadcast scheduling (extended abstract)
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS

Cites work

• Scheduling algorithms for procrastinators
• Speed is as powerful as clairvoyance

Cited in

(8)

• scientific article; zbMATH DE number 7051282 (Why is no real title available?)
• Online scheduling of time-critical tasks to minimize the number of calibrations
• Minimizing the maximum starting time on-line
• Non-clairvoyantly scheduling to minimize convex functions
• Minimizing the maximum flow time in batch scheduling
• Online scheduling to minimize modified total tardiness with an availability constraint
• Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
• Rejecting jobs to minimize load and maximum flow-time

This page was built for publication: Online scheduling to minimize maximum response time and maximum delay factor

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