Approximation schemes for machine scheduling with resource (in-)dependent processing times

DOI10.1137/1.9781611974331.CH104MaRDI QIDQ4575688zbMATH OpenOpenAlexFDO

Authors Marten Maack, Malin Rau, 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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Machine scheduling with resource dependent processing times
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Single-machine scheduling with time-and-resource-dependent processing times
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• Approximation algorithms for parallel machine scheduling with speed-up resources
• Approximability of scheduling problems with resource consuming jobs
• Single machine scheduling problems with resource dependent processing times

Cited in

(12)

• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
• Improved scheduling with a shared resource
• Online bin packing with cardinality constraints resolved
• An FPTAS for scheduling with resource constraints
• Online bin packing with cardinality constraints resolved
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
• Approximation algorithms for scheduling with resource and precedence constraints
• A unified framework for designing EPTAS for load balancing on parallel machines
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Parallel machine scheduling with speed-up resources

This page was built for publication: Approximation schemes for machine scheduling with resource (in-)dependent processing times

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