A biased random-key genetic algorithm for single-round divisible load scheduling
DOI10.1111/ITOR.12178zbMATH Open1338.90160OpenAlexW1526030233MaRDI QIDQ2806431FDOQ2806431
Thiago F. Noronha, Celso C. Ribeiro, Julliany S. Brandão, 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
Recommendations
- A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
- Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
- scientific article; zbMATH DE number 5842467
- Heuristics for multi-round divisible loads scheduling with limited memory
- Experimental study of scheduling with memory constraints using hybrid methods
scientific computingmetaheuristicparallel processingrandom-key genetic algorithmsdivisible load scheduling
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Mersenne twister
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Experimental study of scheduling with memory constraints using hybrid methods
- Heuristics for multi-round divisible loads scheduling with limited memory
- A genetic algorithm for the weight setting problem in OSPF routing
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Improved heuristics for the regenerator location problem
- Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems
- Biased random-key genetic algorithms with applications in telecommunications
- Title not available (Why is that?)
- Parallel image processing applications on a network of workstations
- A biased random-key genetic algorithm for the minimization of open stacks problem
- Optimum divisible load scheduling on heterogeneous stars with limited memory
- Parallel Processing and Applied Mathematics
- Distributed processing of divisible jobs with communication startup costs
Cited In (11)
- Solving the set packing problem via a maximum weighted independent set heuristic
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
- A biased random key genetic algorithm for the field Technician scheduling problem
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery
- A biased random-key genetic algorithm for the set orienteering problem
Uses Software
This page was built for publication: A biased random-key genetic algorithm for single-round divisible load scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806431)
