Parallel machines scheduling with machine shutdowns
From MaRDI portal
Recommendations
- Scheduling on same-speed processors with at most one downtime on each machine
- Parallel machines scheduling with nonsimultaneous machine available time
- scientific article; zbMATH DE number 1150234
- The effect of machine availability on the worst-case performance of LPT
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
Cites work
Cited in
(15)- An on-line scheduling problem of parallel machines with common maintenance time
- Parallel machine scheduling with machine availability and eligibility constraints
- Scheduling on same-speed processors with at most one downtime on each machine
- The effect of machine availability on the worst-case performance of LPT
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
- A semi-on-line scheduling problem of two parallel machines with common maintenance time
- scientific article; zbMATH DE number 1617257 (Why is no real title available?)
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
- Scheduling jobs before shut-down
- Scheduling on uniform processors with at most one downtime on each machine
This page was built for publication: Parallel machines scheduling with machine shutdowns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806577)
