Pages that link to "Item:Q2664346"

The following pages link to An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346):

Displaying 11 items.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
• Matheuristic for the decentralized factories scheduling problem (Q2290271) (← links)
• Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
• 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)