Detail publikačního výsledku

Stochastic Heuristic Techniques for Scheduling Job Shops

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

Originální název

Stochastic Heuristic Techniques for Scheduling Job Shops

Anglický název

Stochastic Heuristic Techniques for Scheduling Job Shops

Druh

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

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.

Anglický 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

2011

Vydáno

01.06.1999

Nakladatel

STU Bratislava

Místo

Tatranské Matliare

ISBN

80-227-1228-0

Kniha

Proceedings of the 12th Conference PROCESS CONTROL ‘99

Strany od

207

Strany počet

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