Pages that link to "Item:Q4661161"
From MaRDI portal
The following pages link to A branch-and-bound-based local search method for the flow shop problem (Q4661161):
Displaying 15 items.
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← 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)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← 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)
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
- A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems (Q2943496) (← links)
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling (Q5426585) (← links)
