The following pages link to (Q3217918):
Displaying 20 items.
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- New directions in scheduling theory (Q786649) (← links)
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- Preemptive scheduling of interval orders is polynomial (Q913500) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- One-machine generalized precedence constrained scheduling problems (Q1342279) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- (Q3396634) (← links)
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints (Q4025912) (← links)
- Open Problem—M/G/1 Scheduling with Preemption Delays (Q5113909) (← links)
- (Q5456411) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
