Single machine scheduling with an availability constraint to minimize makespan

MaRDI QIDQ5257564zbMATH OpenFDO

Authors Ganggang Li, Hao Li

Publication date 29 June 2015

zbMATH Keywords

approximation algorithmavailability constraintdynamic programmingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint
• An approximation algorithm for two-machine scheduling with an availability constraint
• Two-machine scheduling with periodic availability constraints to minimize makespan
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Single Machine Scheduling with an Availability Constraint and Rejection

Cited in

(9)

• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Single machine scheduling with small operator-non-availability periods
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Single Machine Scheduling with an Availability Constraint and Rejection
• An approximation algorithm for two-machine scheduling with an availability constraint
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint
• Makespan Minimization with Machine Availability Constraints
• A single machine scheduling problem with availability constraints and sequence-dependent setup costs
• The coordination of single-machine scheduling with availability constraints and delivery

This page was built for publication: Single machine scheduling with an availability constraint to minimize makespan

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