Publication detail

Stochastic Heuristic Techniques for Scheduling Job Shops

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

Original Title

Stochastic Heuristic Techniques for Scheduling Job Shops

Type

conference paper

Language

English

Original Abstract

Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic methods (simulated annealing, tabu search and genetic algorithms). It presents computational results achieved for two typical representation schemes using standard benchmark problems.

Key words in English

job shop, scheduling, heuristics

Authors

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

Released

1. 6. 1999

Publisher

STU Bratislava

Location

Tatranské Matliare

ISBN

80-227-1228-0

Book

Proceedings of the 12th Conference PROCESS CONTROL ‘99

Pages from

207

Pages to

211

Pages count

5

BibTex

@inproceedings{BUT20815,
  author="Miloš {Šeda} and Jiří {Dvořák}",
  title="Stochastic Heuristic Techniques for Scheduling Job Shops",
  booktitle="Proceedings of the 12th Conference PROCESS CONTROL ‘99",
  year="1999",
  pages="5",
  publisher="STU Bratislava",
  address="Tatranské Matliare",
  isbn="80-227-1228-0"
}