The following pages link to Scheduling Opposing Forests (Q4745255):
Displaying 21 items.
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- Applications of scheduling theory to formal language theory (Q1082085) (← links)
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
- Dynamic scheduling of parallel computations (Q1583589) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- Preemptive scheduling with variable profile, precedence constraints and due dates (Q1805445) (← links)
- A backward approach in list scheduling algorithms for multi-machine tardiness problems (Q1891242) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873) (← links)
- Profile Scheduling of Opposing Forests and Level Orders (Q3698629) (← links)
- Scheduling jobs in open shops with limited machine availability (Q4809658) (← links)
- Optimal parallel processing of random task graphs (Q5939271) (← links)
- On-line scheduling of parallel jobs with runtime restrictions (Q5958714) (← links)
