Supercomputer Scheduling with Combined Evolutionary Techniques
From MaRDI portal
Publication:3603111
DOI10.1007/978-3-540-69277-5_4zbMath1153.68321OpenAlexW2200909367MaRDI QIDQ3603111
Antonio LaTorre, P. de Miguel, Víctor Robles, José-Maria 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
Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Distributed systems (68M14)
Cites Work
- Problem difficulty for tabu search in job-shop scheduling
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Variable neighborhood search
- An ant colony system for permutation flow-shop sequencing
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- A generalized permutation approach to job shop scheduling with genetic 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
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A minimal algorithm for the Bounded Knapsack Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Supercomputer Scheduling with Combined Evolutionary Techniques
