About: Solving General Dynamic Lot Sizing Problem by Means of Stochastic Heuristic Methods.

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Solving General Dynamic Lot Sizing Problem by Means of Stochastic Heuristic Methods. Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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. (en)
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. (en)
skos:notation	RIV/00216305:26210/01:PU22655!RIV/2002/MSM/262102/N
http://linked.open.../vavai/riv/strany	86/1
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM 261100009)
http://linked.open...vai/riv/dodaniDat	2002
http://linked.open...aciTvurceVysledku	Palínek, Kamil Martinek, Vlastimil Dvořák, Jiří
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta strojního inženýrství
http://linked.open...dnocenehoVysledku	696337
http://linked.open...ai/riv/idVysledku	RIV/00216305:26210/01:PU22655
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Dynamic lot sizing, general product structure, stochastic heuristic methods. (en)
http://linked.open.../riv/klicoveSlovo	Dynamic lot sizing stochastic heuristic methods. general product structure
http://linked.open...ontrolniKodProRIV	[B691111CDFC8]
http://linked.open...v/mistoKonaniAkce	Štrbské pleso
http://linked.open...i/riv/mistoVydani	Bratislava
http://linked.open...i/riv/nazevZdroje	Proceedings of the 13th International Conference on PROCESS CONTROL ‘01
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...UplatneniVysledku	2001
http://linked.open...iv/tvurceVysledku	Dvořák, Jiří Martinek, Vlastimil Palínek, Kamil
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2001-06-11 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20261100009
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Slovenská technická univerzita v Bratislave
https://schema.org/isbn	80-227-1542-5
http://localhost/t...ganizacniJednotka	26210

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software