scientific article; zbMATH DE number 6453531
From MaRDI portal
Publication:5260122
Recommendations
- Optimal parallel machines scheduling with availability constraints
- Parallel machine scheduling with machine availability and eligibility constraints
- Parallel-machine scheduling with time-dependent and machine availability constraints
- Approximation schemes for parallel machine scheduling with availability constraints
- scientific article; zbMATH DE number 6672186
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Parallel scheduling problem with non-simultaneous machine available times
- Parallel machines scheduling with nonsimultaneous machine available time
- Rescheduling of identical parallel machines under machine eligibility constraints.
- Machine scheduling with an availability constraint
Cited in
(7)- Machine scheduling with availability constraints
- Two parallel machines scheduling with one availability constraint and jobs with delivery times
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
- Optimal parallel machines scheduling with availability constraints
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Single machine scheduling with semi-resumable machine availability constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260122)
