Two parallel machines scheduling with periodic maintenance to minimize makespan

zbMATH Open1224.90070MaRDI QIDQ3072003FDOQ3072003

Authors: Zhenmin Cheng, Xijuan Zhang, Hongxing Li 

Publication date: 5 February 2011

Recommendations

• Single-machine scheduling with periodic maintenance to minimize makespan
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
• Parallel machines scheduling with machine maintenance for minsum criteria
• Single-machine scheduling with periodic maintenance to minimize makespan revisited

zbMATH Keywords

makespanLPT algorithmparallel machine schedulingperiodical maintenance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99)

Cited In (7)

• Single-machine scheduling with periodic maintenance to minimize makespan
• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
• Some results of scheduling with multi-phase maintenances on two identical machines
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Scheduling two machines that require multiple types of maintenance, for a single operation
• Unknown Input Observers Designed by Eigenstructure Assignment

This page was built for publication: Two parallel machines scheduling with periodic maintenance to minimize makespan

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