A biased random-key genetic algorithm for single-round divisible load scheduling

DOI10.1111/itor.12178zbMath1338.90160OpenAlexW1526030233MaRDI QIDQ2806431

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

Publication date: 18 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12178

zbMATH Keywords

parallel processingmetaheuristicscientific computingrandom-key genetic algorithmsdivisible load scheduling

Mathematics Subject Classification ID

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

Related Items

Solving the set packing problem via a maximum weighted independent set heuristic, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, A biased random-key genetic algorithm for the maximum quasi-clique problem, A biased random key genetic algorithm for the field Technician scheduling problem, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, 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 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

Uses Software

• MersenneTwister

Cites Work

• Parallel image processing applications on a network of workstations
• Experimental study of scheduling with memory constraints using hybrid methods
• Heuristics for multi-round divisible loads scheduling with limited memory
• Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems
• Distributed processing of divisible jobs with communication startup costs
• A genetic algorithm for the weight setting problem in OSPF routing
• Biased random-key genetic algorithms with applications in telecommunications
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• A biased random-key genetic algorithm for the minimization of open stacks problem
• Mersenne twister
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Improved heuristics for the regenerator location problem
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Parallel Processing and Applied Mathematics
• Unnamed Item