Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints

DOI10.1007/s10878-012-9543-2zbMath1275.90023OpenAlexW1994184712MaRDI QIDQ2392745

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

zbMATH Keywords

schedulingtemperaturecompetitive analysisonline algorithmsresource augmentation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Temperature aware online algorithms for minimizing flow time

Cites Work

• Competitive analysis of online real-time scheduling algorithms under hard energy constraint
• Online scheduling with partial job values: does timesharing or randomization help?
• 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
• Getting the best response for your erg
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item