Pages that link to "Item:Q4279265"
From MaRDI portal
The following pages link to The permutation flow shop problem with sum-of-completion times performance criterion (Q4279265):
Displaying 9 items.
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545) (← links)
- A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← 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)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- (Q3818111) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
- Games, Critical Paths and Assignment Problems in Permutation Flow Shops and Cyclic Scheduling Flow Line Environments (Q4006897) (← links)