Equivalence of some different maintenance activities in single-machine scheduling
From MaRDI portal
Publication:2422132
DOI10.1007/S40305-017-0182-2zbMath1424.90094OpenAlexW2780721628MaRDI QIDQ2422132
Publication date: 18 June 2019
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0182-2
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)
Related Items (2)
Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection ⋮ Single-machine scheduling with maintenance activities and rejection
Cites Work
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Scheduling a maintenance activity to minimize total weighted completion-time
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Machine scheduling with an availability constraint
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Reducibility among Combinatorial Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
This page was built for publication: Equivalence of some different maintenance activities in single-machine scheduling
