Pages that link to "Item:Q2664346"
From MaRDI portal
The following pages link to An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346):
Displaying 4 items.
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
