Detail publikace

Stochastic Heuristic Techniques for Scheduling Job Shops

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

Originální název

Stochastic Heuristic Techniques for Scheduling Job Shops

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova v angličtině

Job shop, scheduling, heuristics.

Autoři

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

Rok RIV

1999

Vydáno

1. 6. 1999

Nakladatel

Slovak University of Technology, Bratislava

Místo

Tatranske Matliare, Slovak Republic

ISBN

80-227-1228-0

Kniha

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

Strany od

207

Strany do

211

Strany počet

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"
}