Single machine scheduling with semi-resumable machine availability constraints

DOI10.1007/s11766-011-2488-xzbMath1240.90140OpenAlexW1987867084MaRDI QIDQ655762

Yong Chen, An Zhang, Zhiyi Tan

Publication date: 27 January 2012

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-011-2488-x

zbMATH Keywords

schedulingapproximation algorithmmachine maintenanceworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance

Cites Work

• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Exponential inapproximability and FPTAS for scheduling with availability constraints
• Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
• Single machine flow-time scheduling with a single breakdown
• Two-machine flowshop scheduling with availability constraints
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• Scheduling with limited machine availability
• Machine scheduling with an availability constraint
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Single machine scheduling with semi-resumable machine availability constraints