An approximation algorithm for two-machine scheduling with an availability constraint

MaRDI QIDQ3193985zbMATH OpenFDO

Authors Ganggang Li, Hao Li

Publication date 28 October 2015

zbMATH Keywords

approximation algorithmavailability constraintfully polynomial-time approximation schemescheduling problem

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)

Recommendations

• A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
• Two-machine open shop scheduling with an availability constraint
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
• Two-machine scheduling with periodic availability constraints to minimize makespan
• Single machine scheduling with an availability constraint to minimize makespan

Cited in

(8)

• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
• Two-machine scheduling with periodic availability constraints to minimize makespan
• scientific article; zbMATH DE number 5732726 (Why is no real title available?)
• Single machine scheduling with an availability constraint to minimize makespan
• Two-machine open shop scheduling with an availability constraint
• Improved algorithms for two single machine scheduling problems
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

This page was built for publication: An approximation algorithm for two-machine scheduling with an availability constraint

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