Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
From MaRDI portal
Publication:1761146
DOI10.1016/j.cor.2011.11.002zbMath1251.90162OpenAlexW1964068393MaRDI QIDQ1761146
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.002
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (10)
A scheduling problem with three competing agents ⋮ Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates ⋮ Patient scheduling with periodic deteriorating maintenance on single medical device ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Equivalence of some different maintenance activities in single-machine scheduling ⋮ Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ 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
Cites Work
- Unnamed Item
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Stochastic optimization for the calculation of the time dependency of the physiological demand during exercise and recovery
- Minimizing the number of tardy job units under release time constraints
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Single machine flow-time scheduling with a single breakdown
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Scheduling jobs under simple linear deterioration
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A single-machine scheduling problem with maintenance activities to minimize makespan
- An exact method to minimize the number of tardy jobs in single machine scheduling
- 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
- Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
- A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model
- Single-machine scheduling with flexible and periodic maintenance
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Single-machine scheduling subject to stochastic breakdowns
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Simple Optimality Proof of Moore's Sequencing Algorithm
This page was built for publication: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
