Online scheduling to minimize maximum response time and maximum delay factor
DOI10.4086/TOC.2012.V008A007zbMATH Open1260.68470OpenAlexW2295822836MaRDI QIDQ2913807FDOQ2913807
Chandra Chekuri, Benjamin Moseley, Sungjin Im
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a007
Recommendations
online schedulingresource augmentationbroadcast schedulingmaximum delay factormaximum weighted response time
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (8)
- Title not available (Why is that?)
- 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)