Solving a Capacitated Dynamic Lot Sizing Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31550" target="_blank" >RIV/00216305:26210/02:PU31550 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving a Capacitated Dynamic Lot Sizing Problem
Original language description
This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose a method for solving this problem based on genetic algorithhms
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
In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium
ISBN
3/901509-29-1
ISSN
—
e-ISSN
—
Number of pages
344
Pages from-to
343-686
Publisher name
DAAAM International Vienna
Place of publication
Vienna, Austria
Event location
Vienna
Event date
Oct 23, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—