Single machine scheduling with semi-resumable machine availability constraints

DOI10.1007/S11766-011-2488-XMaRDI QIDQ655762zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmschedulingworst-case analysismachine maintenance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation results for flow shop scheduling problems with machine availability constraints
• Two-machine flowshop scheduling with availability constraints
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
• scientific article; zbMATH DE number 6453531
• scientific article; zbMATH DE number 5732726

Cites work

• scientific article; zbMATH DE number 3698707 (Why is no real title available?)
• scientific article; zbMATH DE number 3510069 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Exponential inapproximability and FPTAS for scheduling with availability constraints
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Machine scheduling with an availability constraint
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• Scheduling with limited machine availability
• Single machine flow-time scheduling with a single breakdown
• Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
• Two-machine flowshop scheduling with availability constraints

Cited in

(6)

• Single machine scheduling with small operator-non-availability periods
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability
• Single Machine Scheduling with an Availability Constraint and Rejection
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
• A single machine scheduling problem with availability constraints and sequence-dependent setup costs
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints

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

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