Advice complexity of fine-grained job shop scheduling

DOI10.1007/978-3-319-18173-8_31MaRDI QIDQ2947041zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2044495 (Why is no real title available?)
• Advice complexity and barely random algorithms
• How Much Information about the Future Is Needed?
• Information complexity of online problems
• Job shop scheduling with unit length tasks
• Online algorithms with advice: the tape model
• Online computation with advice

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)