Parallel machine scheduling with periodic availability constraints to minimize makespan
From MaRDI portal
Cites work
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Algorithms for Scheduling Independent Tasks
- Bin packing can be solved within 1+epsilon in linear time
- Bounds on Multiprocessing Timing Anomalies
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Scheduling flexible maintenance activities subject to job-dependent machine deterioration
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
- Scheduling the maintenance on a single machine
- Scheduling with cardinality dependent unavailability periods
- Scheduling with periodic availability constraints to minimize makespan
- Single-machine scheduling with job-dependent machine deterioration
- Single-machine scheduling with periodic maintenance to minimize makespan
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Two-machine scheduling with periodic availability constraints to minimize makespan
This page was built for publication: Parallel machine scheduling with periodic availability constraints to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227473)
