Single-machine scheduling with periodic maintenance to minimize makespan

DOI10.1016/j.cor.2005.05.034zbMath1159.90404MaRDI QIDQ858282

Publication date: 9 January 2007

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

Full work available at URL: http://hdl.handle.net/10397/656

zbMATH Keywords

single-machine scheduling; approximation algorithm; non-approximability; periodic maintenance; nonresumable jobs

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B25: Reliability, availability, maintenance, inspection in operations research

Related Items

Human resources scheduling to improve the product quality according to exhaustion limit, Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling, Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance, Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate, Scheduling two parallel machines with machine-dependent availabilities, A binary multiple knapsack model for single machine scheduling with machine unavailability, Single machine scheduling problem with two synergetic agents and piece-rate maintenance, Single-machine scheduling with periodic maintenance to minimize makespan revisited, Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times, A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times, A single machine scheduling problem with availability constraints and sequence-dependent setup costs, Scheduling jobs under increasing linear machine maintenance time, The coordination of single-machine scheduling with availability constraints and delivery, A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines, 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, Makespan minimization for two parallel machines scheduling with a periodic availability constraint, Scheduling a maintenance activity and due-window assignment on a single machine, A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, Two-state optimal maintenance planning of repairable systems with covariate effects, Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness, A lower bound for minimizing the total completion time of a three-agent scheduling problem, Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times, Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies, Order acceptance and scheduling with machine availability constraints, A single-machine scheduling problem with maintenance activities to minimize makespan, Single-machine common due date total earliness/tardiness scheduling with machine unavailability, Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance, Approximation schemes for scheduling a maintenance and linear deteriorating jobs, Single machine scheduling with small operator-non-availability periods, Two-machine scheduling with periodic availability constraints to minimize makespan

Cites Work