Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
From MaRDI portal
Publication:5188149
DOI10.1080/02522667.2009.10699933zbMath1190.90070OpenAlexW2006077071MaRDI QIDQ5188149
Publication date: 10 March 2010
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2009.10699933
Related Items
Cites Work
- Parallel machines scheduling with nonsimultaneous machine available time
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
- Machine scheduling with availability constraints
- Nearly on line scheduling of preemptive independent tasks
- Current trends in deterministic scheduling
- Scheduling preemptable tasks on parallel processors with limited availability
- The effect of machine availability on the worst-case performance of LPT
- Parallel machines scheduling with machine shutdowns
- Parallel machine scheduling under a grade of service provision
- Makespan minimization for two parallel machines with an availability constraint
- A note on parallel machine scheduling with non-simultaneous machine available time
- Scheduling with limited machine availability
- Machine scheduling with an availability constraint
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
