Publication detail
Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
ŠEDA, M. DVOŘÁK, J. BURDA, J.
Czech title
Rozvrhování zakázkové výroby s využitím genetických algoritmů a lokálního hledání
English title
Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
Type
conference paper
Language
en
Original abstract
This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical representation schemes using standard benchmark problems.
English abstract
This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical representation schemes using standard benchmark problems.
Keywords in English
Job shop scheduling, stochastic heuristic methods, disjunctive graph
RIV year
1999
Released
01.06.1999
Publisher
VUT FSI ÚAI
Location
Brno, ČR
ISBN
80-214-1131-7
Book
Mendel '99. 5th International Conference on Soft Computing
Pages from–to
131–138
Pages count
8
BIBTEX
@inproceedings{BUT65,
author="Miloš {Šeda} and Jiří {Dvořák} and Jiří {Burda},
title="Scheduling Job Shops Using Genetic Algorithms and Local Search Framework",
booktitle="Mendel '99. 5th International Conference on Soft Computing",
year="1999",
month="June",
pages="131--138",
publisher="VUT FSI ÚAI",
address="Brno, ČR",
isbn="80-214-1131-7"
}