Publication result detail

Stochastic Heuristic Techniques for Scheduling Job Shops

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

Original Title

Stochastic Heuristic Techniques for Scheduling Job Shops

English Title

Stochastic Heuristic Techniques for Scheduling Job Shops

Type

Paper in proceedings (conference paper)

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.

English 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

01.06.1999

Publisher

Slovak University of Technology, Bratislava

Location

Tatranske Matliare, Slovak Republic

ISBN

80-227-1228-0

Book

Process Control '99. 12th Conference. Proceedings Volume 1

Pages from

207

Pages to

211

Pages count

5

BibTex

@inproceedings{BUT68,
  author="Miloš {Šeda} and Jiří {Dvořák}",
  title="Stochastic Heuristic Techniques for Scheduling Job Shops",
  booktitle="Process Control '99. 12th Conference. Proceedings Volume 1",
  year="1999",
  pages="207--211",
  publisher="Slovak University of Technology, Bratislava",
  address="Tatranske Matliare, Slovak Republic",
  isbn="80-227-1228-0"
}