Scheduling with periodic availability constraints to minimize makespan
From MaRDI portal
Publication:6577343
DOI10.1007/s10951-023-00790-wzbMATH Open1543.90118MaRDI QIDQ6577343
Publication date: 23 July 2024
Published in: Journal of Scheduling (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Models and algorithms of time-dependent scheduling
- Single-machine scheduling with periodic maintenance to minimize makespan
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Bin packing can be solved within 1+epsilon in linear time
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Two-machine scheduling with periodic availability constraints to minimize makespan
- Machine scheduling with an availability constraint
- Scheduling the maintenance on a single machine
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Scheduling with periodic availability constraints to minimize makespan
