Pages that link to "Item:Q2488216"
From MaRDI portal
The following pages link to Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216):
Displaying 19 items.
- Parallel machine covering with limited number of preemptions (Q462268) (← links)
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (Q596461) (← links)
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- Rational preemptive scheduling (Q1105366) (← links)
- Optimal scheduling on parallel machines for a new order class (Q1306374) (← links)
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches (Q1396837) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results (Q3598041) (← links)
- On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines (Q4850091) (← links)
- (Q5399877) (← links)
- Algorithms – ESA 2005 (Q5475867) (← links)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
