Optimal scheduling with nested time intervals and three-dimensional strip packing on comparability graphs of an arborescence order
From MaRDI portal
Publication:2829147
zbMATH Open1348.90006MaRDI QIDQ2829147FDOQ2829147
Authors: Thomas Rieger 
Publication date: 26 October 2016
Recommendations
- An existence theorem for packing problems with implications for the computation of optimal machine schedules
- The \(k\)-track assignment problem
- Packing problems and project scheduling models: an integrating perspective
- scientific article; zbMATH DE number 1830743
- Fixed interval scheduling: models, applications, computational complexity and algorithms
Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial aspects of packing and covering (05B40)
This page was built for publication: Optimal scheduling with nested time intervals and three-dimensional strip packing on comparability graphs of an arborescence order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829147)
