Single-machine scheduling with periodic maintenance and nonresumable jobs.
From MaRDI portal
Publication:1868816
DOI10.1016/S0305-0548(02)00074-6zbMath1037.90031MaRDI QIDQ1868816
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (36)
Human resources scheduling to improve the product quality according to exhaustion limit ⋮ An Extended Sequential Imperfect Preventive Maintenance Model with Improvement Factors ⋮ Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Single-machine scheduling with periodic maintenance to minimize makespan ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ 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 ⋮ Patient scheduling with periodic deteriorating maintenance on single medical device ⋮ Scheduling two parallel machines with machine-dependent availabilities ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Scheduling with tool changes to minimize total completion time under controllable machining conditions ⋮ Optimum sequential preventive maintenance first or last policies with imperfect maintenance for a system subject to shocks ⋮ Managing a portfolio of long term service agreements ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ Scheduling with day shifts and breaks ⋮ Maintenance scheduling problem with fuzzy random time windows on a single machine ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period ⋮ Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times ⋮ Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ 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 ⋮ 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 ⋮ Minimizing maximum tardiness in single FMS machine scheduling with tool changes ⋮ Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint ⋮ Two-machine scheduling with periodic availability constraints to minimize makespan ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance ⋮ Scheduling a maintenance activity to minimize total weighted completion-time ⋮ Sequencing heuristic for bicriteria scheduling in a single machine problem
Cites Work
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Two-machine flowshop scheduling with availability constraints
- Minimizing the sum of job completion times on capacitated parallel machines
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Machine scheduling with an availability constraint
- Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
This page was built for publication: Single-machine scheduling with periodic maintenance and nonresumable jobs.
