Pages that link to "Item:Q3517881"
From MaRDI portal
The following pages link to A new polynomial algorithm for a parallel identical scheduling problem (Q3517881):
Displaying 4 items.
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- (Q3115252) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)