A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
From MaRDI portal
Publication:5364070
DOI10.1111/itor.12429zbMath1371.90052OpenAlexW2617162982MaRDI QIDQ5364070
Thiago F. Noronha, Julliany S. Brandão, Celso Carneiro Ribeiro, Mauricio G. C. Resende
Publication date: 2 October 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12429
metaheuristicsdivisible loadsbiased random-key genetic algorithmsdivisible load schedulingmulti-round
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery ⋮ A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
This page was built for publication: A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
