Publication detail
Stochastic Heuristic Techniques for Scheduling Job Shops
ŠEDA, M. DVOŘÁK, J.
Czech title
Stochastické heuristické metody pro rozvrhování zakázkové výroby
English title
Stochastic Heuristic Techniques for Scheduling Job Shops
Type
conference paper
Language
en
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.
Czech abstract
Rozvrhování zakázkové výroby patří do třídy NP-těžkých problémů, a proto exaktní metody mohou být použity pouze pro velmi jednoduché případy. Příspěvek se zaměřuje na řešení problému pomocí stochastických heuristických metod (simulované žíhání, tabu search a genetické algoritmy). Prezentuje výsledky výpočtů dosažené pro dvě typické reprezentace problému na standardních testovacích úlohách.
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.
Keywords in English
job shop, scheduling, heuristics
Released
01.06.1999
Publisher
STU Bratislava
Location
Tatranské Matliare
ISBN
80-227-1228-0
Book
Proceedings of the 12th Conference PROCESS CONTROL ‘99
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",
month="June",
publisher="STU Bratislava",
address="Tatranské Matliare",
isbn="80-227-1228-0"
}