Modeling Job Shop Scheduling Problem for Real-Life Conditions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31549" target="_blank" >RIV/00216305:26210/02:PU31549 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Modeling Job Shop Scheduling Problem for Real-Life Conditions
Original language description
This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose anextended disjunctive graph. The resulting model can be solved by means of stochastic heuristic methods (simulated annealing, taboo search, genetic algorithms). An example solved by simulated annealing is presented.
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
2002
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
Proceedings of the 8th International Conference on Soft Computing MENDEL 2002
ISBN
80-214-2135-5
ISSN
—
e-ISSN
—
Number of pages
362
Pages from-to
357-718
Publisher name
Brno University of Technology
Place of publication
Brno, Czech Republic
Event location
Brno
Event date
Jun 5, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—