Pages that link to "Item:Q2766112"
From MaRDI portal
The following pages link to A new lower bounding rule for permutation flow shop scheduling (Q2766112):
Displaying 5 items.
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724) (← links)