Optimal scheduling of contract algorithms with soft deadlines

DOI10.1007/s10951-016-0483-zzbMath1376.90021OpenAlexW2168704598MaRDI QIDQ2400436

Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel

Publication date: 1 September 2017

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0483-z

zbMATH Keywords

contract algorithmsacceleration ratiointerruptible algorithmsanytime computationscheduling problems in artificial intelligence

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Further connections between contract-scheduling and ray-searching problems ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Optimal scheduling of contract algorithms with soft deadlines ⋮ Interruptible algorithms for multiproblem solving

Cites Work

• Unnamed Item
• Search games
• Optimal sequencing of contract algorithms
• Optimal scheduling of contract algorithms with soft deadlines
• Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
• Lower bounds in on-line geometric searching

This page was built for publication: Optimal scheduling of contract algorithms with soft deadlines