This HTML5 document contains 46 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/
n20http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26210%2F01%3APU22655%21RIV%2F2002%2FMSM%2F262102%2FN/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F01%3APU22655%21RIV%2F2002%2FMSM%2F262102%2FN
rdf:type
n7: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/or successors. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horrizon. We study the possibilities of solving this problem by means of genetic algorithm, simulated annealing, and tabu search. 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/or successors. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horrizon. We study the possibilities of solving this problem by means of genetic algorithm, simulated annealing, and tabu search.
dcterms:title
Solving General Dynamic Lot Sizing Problem by Means of Stochastic Heuristic Methods. Solving General Dynamic Lot Sizing Problem by Means of Stochastic Heuristic Methods.
skos:prefLabel
Solving General Dynamic Lot Sizing Problem by Means of Stochastic Heuristic Methods. Solving General Dynamic Lot Sizing Problem by Means of Stochastic Heuristic Methods.
skos:notation
RIV/00216305:26210/01:PU22655!RIV/2002/MSM/262102/N
n3:strany
86/1
n3:aktivita
n9:Z
n3:aktivity
Z(MSM 261100009)
n3:dodaniDat
n12:2002
n3:domaciTvurceVysledku
n15:5337011 n15:4605802 n15:2802732
n3:druhVysledku
n16:D
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
696337
n3:idVysledku
RIV/00216305:26210/01:PU22655
n3:jazykVysledku
n18:eng
n3:klicovaSlova
Dynamic lot sizing, general product structure, stochastic heuristic methods.
n3:klicoveSlovo
n14:Dynamic%20lot%20sizing n14:general%20product%20structure n14:stochastic%20heuristic%20methods.
n3:kontrolniKodProRIV
[B691111CDFC8]
n3:mistoKonaniAkce
Štrbské pleso
n3:mistoVydani
Bratislava
n3:nazevZdroje
Proceedings of the 13th International Conference on PROCESS CONTROL ‘01
n3:obor
n19:BB
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:rokUplatneniVysledku
n12:2001
n3:tvurceVysledku
Dvořák, Jiří Palínek, Kamil Martinek, Vlastimil
n3:typAkce
n13:WRD
n3:zahajeniAkce
2001-06-11+02:00
n3:zamer
n11:MSM%20261100009
s:numberOfPages
7
n20:hasPublisher
Slovenská technická univerzita v Bratislave
n17:isbn
80-227-1542-5
n6:organizacniJednotka
26210