Pages that link to "Item:Q1141078"

The following pages link to An adaptive branching rule for the permutation flow-shop problem (Q1141078):

Displaying 29 items.

• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
• Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← 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 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)
• Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
• Heuristics and their design: A survey (Q1152854) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Heuristics for the flow line problem with setup costs (Q1303708) (← links)
• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770) (← links)
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
• Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
• Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← 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)
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems (Q2265944) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← 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)
• Flowshop sequencing problems with limited buffer storage (Q3489782) (← links)
• An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
• Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)