Pages that link to "Item:Q1789013"
From MaRDI portal
The following pages link to A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013):
Displaying 6 items.
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times (Q2293429) (← links)
- A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production (Q2293881) (← links)
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
- Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)
