Pages that link to "Item:Q1810503"
From MaRDI portal
The following pages link to Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503):
Displaying 13 items.
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines (Q439457) (← links)
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- Preemptive scheduling with deadlines on parallel machines (Q2917044) (← links)
- (Q3680271) (← links)
- Algorithms – ESA 2005 (Q5475867) (← links)
