Pages that link to "Item:Q1266538"

The following pages link to Two branch and bound algorithms for the permutation flow shop problem (Q1266538):

Displaying 24 items.

• Exact resolution of the two-stage hybrid flow shop with dedicated machines (Q479265) (← 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)
• An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
• A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
• Heuristics for the flow line problem with setup costs (Q1303708) (← 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)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems (Q1761190) (← links)
• A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
• Flow-shop scheduling for three serial stations with the last two duplicate (Q1886869) (← 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)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
• Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
• A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
• On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
• A branch-and-bound-based local search method for the flow shop problem (Q4661161) (← links)
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← 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)