Pages that link to "Item:Q880570"
From MaRDI portal
The following pages link to Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570):
Displaying 13 items.
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times (Q2861538) (← links)
- (Q3347609) (← links)
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases (Q4645936) (← links)
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (Q4717402) (← links)
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
