Pages that link to "Item:Q1819236"

The following pages link to A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem (Q1819236):

Displaying 12 items.

• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times (Q967801) (← links)
• No-wait flowshops with bicriteria of makespan and maximum lateness. (Q1410329) (← links)
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem (Q1919850) (← links)
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
• A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872) (← links)
• A branch-and-bound-based local search method for the flow shop problem (Q4661161) (← links)
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (Q4849290) (← links)
• Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)