Advice Complexity of Fine-Grained Job Shop Scheduling

DOI10.1007/978-3-319-18173-8_31zbMath1459.68235OpenAlexW2236451033MaRDI QIDQ2947041

David Wehner

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/156336

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items

Online Graph Coloring Against a Randomized Adversary

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms with advice: the tape model
• Online computation with advice
• Job shop scheduling with unit length tasks
• Advice Complexity and Barely Random Algorithms
• Information Complexity of Online Problems
• How Much Information about the Future Is Needed?