An FPTAS for scheduling with resource constraints

DOI10.1016/J.ORL.2023.06.001MaRDI QIDQ6047696zbMATH OpenOpenAlexFDO

Authors Bo Chen, V. A. Strusevich

Publication date 12 September 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

approximationresource constraintscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• A PTAS for a resource scheduling problem with arbitrary number of parallel machines
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• Resource constrained scheduling on multiple machines

Cites work

• A cyclical search for the two machine flow shop and open shop to minimise finishing time
• A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Approximation of the parallel machine scheduling problem with additional unit resources
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• scientific article; zbMATH DE number 3786125 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Open Shop Scheduling to Minimize Finish Time
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Scheduling subject to resource constraints: Classification and complexity

Cited in

(1)

• Fast combination of scheduling chains under resource and time constraints

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

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