GA-Based Dynamic Lot Sizing under Stochastic Demands

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F10%3APU88086" target="_blank" >RIV/00216305:26210/10:PU88086 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
GA-Based Dynamic Lot Sizing under Stochastic Demands
Original language description
This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and successors. We assume a finite planning horizon consisting of discrete time periods, dynamic lot sizes, multiple constrained resources, time-varying cost parameters and stochastic demands. The objective is to minimize the sum of total production and setup costs and mean values of holding costs andbackorder penalty costs. The paper starts from the deterministic model, and investigates a modification of this model for the case of stochastic demands. A solution method based on genetic algorithm is described and results of computational experimentsare presented.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
MENDEL 2010. 16th International Conference on Soft Computing
ISBN
978-80-214-4120-0
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
Brno University of Technology
Place of publication
Brno
Event location
Brno University of Technology
Event date
Jun 23, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)