Supercomputer Scheduling with Combined Evolutionary Techniques
DOI10.1007/978-3-540-69277-5_4zbMATH Open1153.68321OpenAlexW2200909367MaRDI QIDQ3603111FDOQ3603111
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
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
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)
Cites Work
- Title not available (Why is that?)
- Problem difficulty for tabu search in job-shop scheduling
- Variable neighborhood search
- An ant colony system for permutation flow-shop sequencing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Guided local search with shifting bottleneck for job shop scheduling
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Title not available (Why is that?)
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- A minimal algorithm for the bounded knapsack problem
Cited In (1)
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)