Narrow search
Showing 1 - 5 of 5
Cover Image
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
Reis, Roger; Ritt, Marcus; Buriol, Luciana S.; Resende, … - In: International transactions in operational research : … 18 (2011) 3, pp. 401-423
Persistent link: https://www.econbiz.de/10009126599
Cover Image
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J.; Ritt, Marcus - In: Computers & operations research : and their … 66 (2016), pp. 160-169
Persistent link: https://www.econbiz.de/10011429003
Cover Image
Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J.; Ritt, Marcus - In: Computers & operations research : and their … 100 (2018), pp. 230-243
Persistent link: https://www.econbiz.de/10011930607
Cover Image
Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations
Ritt, Marcus; Rossit, Daniel Alejandro - In: Computers & operations research : an international journal 170 (2024), pp. 1-11
Persistent link: https://www.econbiz.de/10015066278
Cover Image
The Robust Set Covering Problem with interval data
Pereira, Jordi; Averbakh, Igor - In: Computational issues in combintorial optimization, (pp. 217-235). 2013
Persistent link: https://www.econbiz.de/10009789405