Narrow search
Showing 1 - 4 of 4
Cover Image
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Dubois-Lacoste, Jérémie; Pagnozzi, Federico; … - In: Computers & operations research : and their … 81 (2017), pp. 160-166
Persistent link: https://www.econbiz.de/10011656030
Cover Image
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints
Pagnozzi, Federico; Stützle, Thomas G. - In: Operations research perspectives 8 (2021), pp. 1-17
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to...
Persistent link: https://www.econbiz.de/10012435328
Cover Image
The weighted independent domination problem : integer linear programming models and metaheuristic approaches
Pinacho Davidson, Pedro; Blum, Christian; Lozano, Jose A. - In: European journal of operational research : EJOR 265 (2018) 3, pp. 860-871
Persistent link: https://www.econbiz.de/10011778513
Cover Image
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints
Pagnozzi, Federico; Stützle, Thomas G. - In: Operations Research Perspectives 8 (2021), pp. 1-17
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to...
Persistent link: https://www.econbiz.de/10012662830