Pages that link to "Item:Q336351"
From MaRDI portal
The following pages link to An assignment-based lower bound for a class of two-machine flow shop problems (Q336351):
Displaying 4 items.
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- A new lower bound for the open-shop problem (Q1960317) (← links)
- Multiple-machine lower bounds for shop-scheduling problems (Q2884494) (← links)