This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26210%2F10%3APU88086%21RIV11-GA0-26210___/
n14http://purl.org/net/nknouf/ns/bibtex#
n9http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
shttp://schema.org/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F10%3APU88086%21RIV11-GA0-26210___
rdf:type
n10:Vysledek skos:Concept
dcterms: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 and backorder 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 experiments are presented. 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 and backorder 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 experiments are presented.
dcterms:title
GA-Based Dynamic Lot Sizing under Stochastic Demands GA-Based Dynamic Lot Sizing under Stochastic Demands
skos:prefLabel
GA-Based Dynamic Lot Sizing under Stochastic Demands GA-Based Dynamic Lot Sizing under Stochastic Demands
skos:notation
RIV/00216305:26210/10:PU88086!RIV11-GA0-26210___
n6:aktivita
n12:P
n6:aktivity
P(1M06047), P(GA103/08/1658)
n6:dodaniDat
n8:2011
n6:domaciTvurceVysledku
n15:9749381 n15:5337011 n15:4221494
n6:druhVysledku
n18:D
n6:duvernostUdaju
n7:S
n6:entitaPredkladatele
n21:predkladatel
n6:idSjednocenehoVysledku
260184
n6:idVysledku
RIV/00216305:26210/10:PU88086
n6:jazykVysledku
n17:eng
n6:klicovaSlova
dynamic lot sizes, general product structure, stochastic demands, genetic algorithm
n6:klicoveSlovo
n16:dynamic%20lot%20sizes n16:genetic%20algorithm n16:general%20product%20structure n16:stochastic%20demands
n6:kontrolniKodProRIV
[0BC8637DE52E]
n6:mistoKonaniAkce
Brno University of Technology
n6:mistoVydani
Brno
n6:nazevZdroje
MENDEL 2010. 16th International Conference on Soft Computing
n6:obor
n20:BB
n6:pocetDomacichTvurcuVysledku
3
n6:pocetTvurcuVysledku
3
n6:projekt
n11:1M06047 n11:GA103%2F08%2F1658
n6:rokUplatneniVysledku
n8:2010
n6:tvurceVysledku
Dvořák, Jiří Grulich, Martin Herůdek, Vladimír
n6:typAkce
n13:WRD
n6:zahajeniAkce
2010-06-23+02:00
s:numberOfPages
6
n14:hasPublisher
Vysoké učení technické v Brně
n19:isbn
978-80-214-4120-0
n9:organizacniJednotka
26210