Application of Genetic Algorithms to Scheduling and Lot Sizing in a Flow Shop
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F00%3A00000162" target="_blank" >RIV/00216305:26210/00:00000162 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Application of Genetic Algorithms to Scheduling and Lot Sizing in a Flow Shop
Original language description
In this paper we investigate a problem of integrated lot sizing and scheduling in a permutation flow shop under the assumption of constant continuous demands over an infinite planning horizon. The objective is to find a sequence of production and lot sizes that minimise the sum of average set-up costs and average inventory holding costs. We study and compare three approaches based on genetic algorithms.
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
2000
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
6th International Conference on Soft Computing MENDEL 2000
ISBN
80-214-1609-2
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
—
Publisher name
PC-DIR Brno
Place of publication
Brno, Czech Republic
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—