Advice complexity of fine-grained job shop scheduling

DOI10.1007/978-3-319-18173-8_31zbMATH Open1459.68235OpenAlexW2236451033MaRDI QIDQ2947041FDOQ2947041

Authors: 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

Recommendations

• Online makespan scheduling with sublinear advice
• On the Advice Complexity of Online Problems
• Advice complexity and barely random algorithms
• Advice complexity and barely random algorithms
• Online algorithms with advice for bin packing and scheduling problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Information complexity of online problems
• Online computation with advice
• How Much Information about the Future Is Needed?
• Advice complexity and barely random algorithms
• Online algorithms with advice: the tape model
• Job shop scheduling with unit length tasks
• Title not available (Why is that?)

Cited In (2)

• Online makespan scheduling with sublinear advice
• Online graph coloring against a randomized adversary

This page was built for publication: Advice complexity of fine-grained job shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947041)