Scheduling a maintenance activity to minimize total weighted completion-time

DOI10.1016/j.camwa.2008.11.008zbMath1165.90465OpenAlexW2036730102MaRDI QIDQ1029850

Gur Mosheiov, Assaf Sarig

Publication date: 13 July 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.11.008

zbMATH Keywords

heuristicsschedulingdynamic programmingsingle machinemaintenance activityweighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities ⋮ 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 ⋮ Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job ⋮ Scheduling with deterioration effects and maintenance activities under parallel processors ⋮ Equivalence of some different maintenance activities in single-machine scheduling ⋮ Optimization of scheduling problems with deterioration effects and an optional maintenance activity ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models ⋮ A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times ⋮ Single-machine scheduling with job-dependent machine deterioration

Cites Work

• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
• Two-machine flowshop scheduling with availability constraints
• Machine scheduling with a rate-modifying activity
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• A two-machine flowshop scheduling problem with a separated maintenance constraint
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
• Planning Machine Maintenance in Two-Machine Shop Scheduling
• Scheduling a maintenance activity on parallel identical machines
• Scheduling jobs and maintenance activities on parallel machines

This page was built for publication: Scheduling a maintenance activity to minimize total weighted completion-time