An FPTAS for scheduling with resource constraints

DOI10.1016/j.orl.2023.06.001zbMath1525.90190OpenAlexW4380997042MaRDI QIDQ6047696

Bo Chen, Vitaly A. Strusevich

Publication date: 12 September 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2023.06.001

zbMATH Keywords

schedulingapproximationresource constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of the parallel machine scheduling problem with additional unit resources
• Scheduling subject to resource constraints: Classification and complexity
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• A cyclical search for the two machine flow shop and open shop to minimise finishing time
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: An FPTAS for scheduling with resource constraints