Adaptive online scheduling of tasks with anytime property on heterogeneous resources

DOI10.1016/J.COR.2016.06.008zbMath1349.68043arXiv1802.02919OpenAlexW2430994543MaRDI QIDQ342556

Přemysl Šucha, Zdeněk Hanzálek, Roman Václavík, Jan Smejkal, István Módos

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.02919

zbMATH Keywords

adaptive systemsanytime algorithmsmachine learningonline scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand
• Scheduling in a dynamic heterogeneous distributed system using estimation error
• Algorithm runtime prediction: methods \& evaluation
• Minimizing total tardiness on a single machine with controllable processing times
• Staff scheduling and rostering: a review of applications, methods and models.
• Online scheduling with partial job values: does timesharing or randomization help?
• A survey of scheduling with controllable processing times
• Multicriteria scheduling
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

This page was built for publication: Adaptive online scheduling of tasks with anytime property on heterogeneous resources