Advice complexity of fine-grained job shop scheduling
From MaRDI portal
Publication:2947041
Recommendations
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)
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)