Stochastic Heuristic Techniques for Scheduling Job Shops
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F99%3A00000064" target="_blank" >RIV/00216305:26210/99:00000064 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Stochastic Heuristic Techniques for Scheduling Job Shops
Original language description
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 name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
1999
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Process Control '99. 12th Conference. Proceedings Volume 1
ISBN
80-277-1228-0
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Slovak University of Technology, Bratislava
Place of publication
Tatranske Matliare, Slovak Republic
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—