A single-machine scheduling problem with maintenance activities to minimize makespan

DOI10.1016/J.AMC.2009.11.040zbMATH Open1181.90117OpenAlexW2078384930MaRDI QIDQ2266971FDOQ2266971

Authors Chou-Jung Hsu, Chinyao Low, Chwen-Tzeng Su

Publication date 26 February 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2009.11.040

zbMATH Keywords

schedulingbinary integer programmingperiodic maintenance

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Recommendations

• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Single-machine scheduling with flexible and periodic maintenance
• Single-machine scheduling with periodic maintenance to minimize makespan
• Single-machine scheduling with periodic maintenance and nonresumable jobs.

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Single-machine scheduling with flexible and periodic maintenance
• Single-machine scheduling with periodic maintenance to minimize makespan

Cited in

(16)

• Scheduling jobs with maintenance subject to load-dependent duration on a single machine
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
• Single-machine scheduling with periodic maintenance to minimize makespan
• Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
• Single-machine scheduling with periodic maintenance to minimize makespan revisited
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Scheduling a maintenance activity and due-window assignment on a single machine
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
• Equivalence of some different maintenance activities in single-machine scheduling
• Robust single machine scheduling with a flexible maintenance activity
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
• Minimizing total completion time on a single machine with a flexible maintenance activity
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
• Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times

This page was built for publication: A single-machine scheduling problem with maintenance activities to minimize makespan

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