Approximation schemes for machine scheduling with resource (in-)dependent processing times
From MaRDI portal
Publication:4575688
DOI10.1137/1.9781611974331.ch104zbMath1410.68401OpenAlexW4245317282MaRDI QIDQ4575688
Malin Rau, Marten Maack, Klaus Jansen
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch104
Related Items
Approximation Algorithms for Scheduling with Resource and Precedence Constraints, A unified framework for designing EPTAS for load balancing on parallel machines, Online bin packing with cardinality constraints resolved, Parallel machine scheduling with speed-up resources, Unnamed Item, Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times