A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems

DOI10.1111/ITOR.12429MaRDI QIDQ5364070zbMATH OpenOpenAlexFDO

Authors Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro

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

zbMATH Keywords

biased random-key genetic algorithmsdivisible load schedulingdivisible loadsmetaheuristicsmulti-round

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A biased random-key genetic algorithm for single-round divisible load scheduling
• Heuristics for multi-round divisible loads scheduling with limited memory
• Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
• Experimental study of scheduling with memory constraints using hybrid methods
• An optimization model for divisible-load scheduling considering processor time-window

Cited in

(15)

• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A biased random-key genetic algorithm for the set orienteering problem
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
• A biased random-key genetic algorithm for single-round divisible load scheduling
• 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
• Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
• A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
• Biased random-key genetic algorithms: a review
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364070)