Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
From MaRDI portal
Publication:2156319
DOI10.1007/s10878-021-00715-3zbMath1495.90069MaRDI QIDQ2156319
Publication date: 18 July 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00715-3
90B35: Deterministic scheduling theory in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Cites Work
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Single-machine scheduling with periodic maintenance to minimize makespan
- Supply chain scheduling problem in the hospital with periodic working time on a single machine
- 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
- The medical laboratory scheduling for weighted flow-time
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
- Machine scheduling with an availability constraint
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Improved bounds for batch scheduling with nonidentical job sizes
- Single batch machine scheduling with deliveries
- Single machine scheduling with a restricted rate-modifying activity
