Pages that link to "Item:Q1575603"
From MaRDI portal
The following pages link to Scheduling preemptable tasks on parallel processors with limited availability (Q1575603):
Displaying 6 items.
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Online scheduling on semi-related machines (Q963475) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- New applications of the Muntz and Coffman algorithm (Q5946720) (← links)
