Detail publikačního výsledku

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

ŠEDA, M., DVOŘÁK, J., BURDA, J.

Originální název

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

Anglický název

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova v angličtině

Job shop scheduling, stochastic heuristic methods, disjunctive graph

Autoři

ŠEDA, M., DVOŘÁK, J., BURDA, J.

Vydáno

01.06.1999

Nakladatel

VUT FSI ÚAI

Místo

Brno, ČR

ISBN

80-214-1131-7

Kniha

Mendel '99. 5th International Conference on Soft Computing

Strany od

131

Strany do

138

Strany počet

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",
  pages="131--138",
  publisher="VUT FSI ÚAI",
  address="Brno, ČR",
  isbn="80-214-1131-7"
}