Pages that link to "Item:Q764320"
From MaRDI portal
The following pages link to A linear time approximation algorithm for permutation flow shop scheduling (Q764320):
Displaying 6 items.
- A note on permutation flow shop problem (Q596465) (← links)
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
- Diversity of processing times in permutation flow shop scheduling problems (Q2050279) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- (Q3818111) (← links)
- Tight Bounds for Permutation Flow Shop Scheduling (Q5895000) (← links)