Approximation schemes for scheduling with availability constraints

DOI10.1007/978-3-642-14553-7_10MaRDI QIDQ3587338zbMATH OpenOpenAlexFDO

Authors Bin Fu, Yumei Huo, Hairong Zhao

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_10

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation schemes for parallel machine scheduling with availability constraints
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
• Exponential inapproximability and FPTAS for scheduling with availability constraints
• Makespan Minimization with Machine Availability Constraints
• Preemptive scheduling with availability constraints to minimize total weighted completion times

Cited in

(10)

• Approximation of the supply scheduling problem
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Exponential inapproximability and FPTAS for scheduling with availability constraints
• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
• Approximation algorithms for scheduling with reservations
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
• Modeling of a scheduling problem with expected availability of resources
• Improved approximation algorithms for scheduling with fixed jobs
• Approximation schemes for parallel machine scheduling with availability constraints
• Tight approximation algorithms for scheduling with fixed jobs and nonavailability

This page was built for publication: Approximation schemes for scheduling with availability constraints

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