Pages that link to "Item:Q5307342"
From MaRDI portal
The following pages link to Parallel Processing and Applied Mathematics (Q5307342):
Displaying 14 items.
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
- Fast combination of scheduling chains under resource and time constraints (Q886400) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal (Q955345) (← links)
- Scheduling three chains on two parallel machines (Q1040986) (← links)
- Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
- Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574) (← links)
- A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- (Q3402864) (← links)
- (Q6068238) (← links)