Pages that link to "Item:Q2178110"

The following pages link to A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110):

Displaying 23 items.

• A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem (Q473807) (← links)
• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem (Q1819236) (← links)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
• P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121) (← links)
• A branch-and-bound-based local search method for the flow shop problem (Q4661161) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
• Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm (Q6048133) (← links)
• Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
• Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
• Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
• Manufacturing rescheduling after crisis or disaster-caused supply chain disruption (Q6106575) (← links)
• A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)
• Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)
• Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns (Q6588509) (← links)