Publication result detail

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

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

Original Title

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

English Title

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

Type

Paper in proceedings (conference paper)

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.

Key words in English

job shop scheduling, stochastic heuristic methods, disjunctive graph

Authors

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

Released

01.06.1999

Publisher

VUT FSI v Brně

Location

Brno

ISBN

80-214-1131-7

Book

Proceedings of the 5th International Conference on Soft Computing

Pages from

131

Pages count

8

BibTex

@inproceedings{BUT20813,
  author="Miloš {Šeda} and Jiří {Dvořák} and Jiří {Burda}",
  title="Scheduling Job Shops Using Genetic Algorithms and Local Search Framework",
  booktitle="Proceedings of the 5th International Conference on Soft Computing",
  year="1999",
  pages="8",
  publisher="VUT FSI v Brně",
  address="Brno",
  isbn="80-214-1131-7"
}