Single swap local search for classical Job Shop and Flexible Job Shop scheduling Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F10%3A%230001816" target="_blank" >RIV/46747885:24210/10:#0001816 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Single swap local search for classical Job Shop and Flexible Job Shop scheduling Problem
Original language description
Nowadays, scheduling is becoming most important tool to satisfy customer needs. Most companies are using systems as ERP (APS), MES or work shop planers. These scheduling systems are usually offering scheduling and optimization using dispatching rules. This article focus on scheduling by these rules and it is comparing it with possible optimization by single swap local search procedure. Comparison is made on theoretical (benchmark) models of both scheduling problems ? classical (JSP) and Flexible Job Shop scheduling Problem (FJSP). Key words:
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JR - Other machinery industry
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
Recenzované CD abstraktů z Mezinárodní Baťovy konference pro doktorandy a mladé vědecké pracovníky 2010
ISBN
978-80-7318-922-8
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
—
Publisher name
Univerzita Tomáše Bati ve Zlíně
Place of publication
Zlín
Event location
Zlín
Event date
Jan 1, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—