Pages that link to "Item:Q2436669"
From MaRDI portal
The following pages link to Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669):
Displaying 11 items.
- Resource loading with time windows (Q319369) (← links)
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width (Q3558924) (← links)
- Ship Traffic Optimization for the Kiel Canal (Q5126634) (← links)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
