Pages that link to "Item:Q1777158"

The following pages link to A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158):

Displaying 33 items.

• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• MILP models for the optimization of real production lines (Q302141) (← links)
• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← 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)
• A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
• Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (Q1121779) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
• A permutation-based approach for solving the job-shop problem (Q1370981) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← 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)
• Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
• A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
• Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop (Q2890475) (← links)
• A three-machine permutation flow-shop problem with minimum makespan on the second machine (Q3378829) (← links)
• On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
• Games, Critical Paths and Assignment Problems in Permutation Flow Shops and Cyclic Scheduling Flow Line Environments (Q4006897) (← links)
• The permutation flow shop problem with sum-of-completion times performance criterion (Q4279265) (← links)
• A branch-and-bound-based local search method for the flow shop problem (Q4661161) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← 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)
• Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)