Pages that link to "Item:Q2861538"
From MaRDI portal
The following pages link to Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times (Q2861538):
Displaying 5 items.
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- (Q5449457) (← links)
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)