Two Approaches to Permutation Flow Shop Scheduling Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31528" target="_blank" >RIV/00216305:26210/02:PU31528 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Two Approaches to Permutation Flow Shop Scheduling Problem
Original language description
In this paper, two different approaches to permutation flow shop scheduling problem are investigated. The first one is based on a mixed integer programming model and is solved by an optimization package GAMS. As the problem belongs to NP-complete problems, this approach is limited to smaller instances, its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings
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 First International Conference on Intelligent Computing and Information Systems ICICIS 2002
ISBN
977-237-172-3
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
123-128
Publisher name
Ain Shams University Cairo
Place of publication
Cairo (Egypt)
Event location
Cairo
Event date
Jun 24, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—