Efficient batch job scheduling in grids using cellular memetic algorithms
From MaRDI portal
Recommendations
- Efficient Batch Job Scheduling in Grids Using Cellular Memetic Algorithms
- Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids
- Scheduling parallel batch jobs in grids with evolutionary metaheuristics
- A tabu search algorithm for scheduling independent jobs in computational grids
- Job scheduling in computational grid using a hybrid algorithm based on genetic algorithm and particle swarm optimization
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2046100 (Why is no real title available?)
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- Cellular genetic algorithms
- Decomposition algorithms for stochastic programming on a computational grid
- Multi-objective optimization using evolutionary algorithms
Cited in
(8)- Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids
- Integration of task abortion and security requirements in GA-based meta-heuristics for independent batch grid scheduling
- Multiprocessor scheduling by generalized extremal optimization
- Efficient Batch Job Scheduling in Grids Using Cellular Memetic Algorithms
- Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems
- Achieving super-linear performance in parallel multi-objective evolutionary algorithms by means of cooperative coevolution
- An efficient implementation of the Min-Min heuristic
- Scheduling parallel batch jobs in grids with evolutionary metaheuristics
This page was built for publication: Efficient batch job scheduling in grids using cellular memetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q928683)