Supercomputer Scheduling with Combined Evolutionary Techniques

DOI10.1007/978-3-540-69277-5_4MaRDI QIDQ3603111zbMATH OpenOpenAlexFDO

Authors Antonio LaTorre, Víctor Robles, P. de Miguel, Jose M. Peña

Publication date 13 February 2009

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69277-5_4

zbMATH Keywords

genetic algorithmsschedulingevolutionary algorithmssupercomputingmultiple offspring sampling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems
• On the integration of theoretical single-objective scheduling results for multi-objective problems
• scientific article; zbMATH DE number 2150747
• scientific article; zbMATH DE number 2221454
• A synergy exploiting evolutionary approach to complex scheduling problems

Cites work

• scientific article; zbMATH DE number 1702339 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1303606 (Why is no real title available?)
• scientific article; zbMATH DE number 1966226 (Why is no real title available?)
• scientific article; zbMATH DE number 4115948 (Why is no real title available?)
• scientific article; zbMATH DE number 925015 (Why is no real title available?)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A generalized permutation approach to job shop scheduling with genetic algorithms
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• A minimal algorithm for the bounded knapsack problem
• A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• An ant colony system for permutation flow-shop sequencing
• Guided local search with shifting bottleneck for job shop scheduling
• Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
• Problem difficulty for tabu search in job-shop scheduling
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• Variable neighborhood search

Cited in

(1)

• Group based job scheduling to increase the high-performance computing efficiency

This page was built for publication: Supercomputer Scheduling with Combined Evolutionary Techniques

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