Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
From MaRDI portal
Publication:2392745
DOI10.1007/S10878-012-9543-2zbMATH Open1275.90023OpenAlexW1994184712MaRDI QIDQ2392745FDOQ2392745
Authors: Yanyan Li 
Publication date: 2 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9543-2
Recommendations
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- STACS 2004
- Temperature aware online algorithms for scheduling equal length jobs
- Temperature aware online algorithms for scheduling equal length jobs
- Temperature aware online algorithms for minimizing flow time
- Temperature aware online algorithms for minimizing flow time
- Online scheduling of bounded length jobs to maximize throughput
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Cites Work
- Title not available (Why is that?)
- Getting the best response for your erg
- Title not available (Why is that?)
- Online scheduling with partial job values: does timesharing or randomization help?
- Title not available (Why is that?)
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
- Temperature Aware Online Scheduling with a Low Cooling Factor
- Title not available (Why is that?)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint
- On unified results involving partial sums of a class of meromorphic functions
Cited In (4)
This page was built for publication: Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392745)
