GIFFLER AND THOMPSON ALGORITHM FOR FLEXIBLE JOB SHOP PROBLEM
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F09%3A%230001437" target="_blank" >RIV/46747885:24210/09:#0001437 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
GIFFLER AND THOMPSON ALGORITHM FOR FLEXIBLE JOB SHOP PROBLEM
Original language description
Giffler and Thompson constructive algorithm (GT) is well known algorithm to construct schedule for theoretical Job Shop Scheduling Problem (JSP). However, practical scheduling problems are not that often classical JSP today. This article presents one ofmodified problems (model), which is already known, and presents simple modification to GT algorithm to solve Flexible Job Shop Scheduling Problem (FJSP).Algorithm is tested on mentioned theoretical FJSP using priority rules.
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
2009
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
4. ročník mezinárodní konference ?Výrobní systémy dnes a zítra 2009?
ISBN
978-80-7372-541-9
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
—
Publisher name
TUL KVS Liberec
Place of publication
Liberec
Event location
Liberec
Event date
Nov 19, 2009
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—