Minimizing total completion time on a single machine with a flexible maintenance activity

DOI10.1016/j.cor.2010.09.003zbMath1202.90148OpenAlexW2168184085MaRDI QIDQ613512

Ying Ma, Shan-Lin Yang, Dong-Ling Xu, Jian-Bo Yang

Publication date: 20 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.003

zbMATH Keywords

dynamic programmingbranch-and-boundsingle machine schedulingflexible maintenanceshortest processing time

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)

Related Items (14)

Digital twin-enabled dynamic scheduling with preventive maintenance using a double-layer Q-learning algorithm ⋮ Integrated production scheduling and maintenance policy for robustness in a single machine ⋮ Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates ⋮ Short‐term scheduling with machine calibration ⋮ Equivalence of some different maintenance activities in single-machine scheduling ⋮ Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization ⋮ Multiobjective optimization of aircraft maintenance in Thailand using goal programming: a decision-support model ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Robust single machine scheduling with a flexible maintenance activity ⋮ Two-machine flow shop scheduling integrated with preventive maintenance planning ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance

Cites Work

• Unnamed Item
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
• Scheduling jobs under increasing linear machine maintenance time
• Single machine flow-time scheduling with scheduled maintenance
• Improved algorithms for two single machine scheduling problems
• A note on worst-case performance of heuristics for maintenance scheduling problems
• Considering scheduling and preventive maintenance in the flowshop sequencing problem
• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• A note: Simple heuristics for scheduling a maintenance activity on unrelated machines
• Scheduling a maintenance activity to minimize total weighted completion-time
• Single machine flow-time scheduling with a single breakdown
• Weighted flow time bounds for scheduling identical processors
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Machine scheduling with availability constraints
• Current trends in deterministic scheduling
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Scheduling with limited machine availability
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• A two-machine flowshop scheduling problem with a separated maintenance constraint
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Machine scheduling with an availability constraint
• Scheduling the maintenance on a single machine
• Single-machine scheduling with flexible and periodic maintenance
• Scheduling a maintenance activity on parallel identical machines
• Minimizing Weighted Completion Times with Deadlines
• Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
• Scheduling jobs and maintenance activities on parallel machines
• Minimizing makespan for two parallel machines with job limit on each availability interval
• Bounds for the cardinality constrained \(P \|C_{max}\) problem

This page was built for publication: Minimizing total completion time on a single machine with a flexible maintenance activity