About: Heuristic Methods for Solving a General Dynamic Lot Sizing Problem

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

About: Heuristic Methods for Solving a General Dynamic Lot Sizing Problem 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, 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 the methods for solving this problem based on genetic algorithms and compare them with methods of other authors. 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, 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 the methods for solving this problem based on genetic algorithms and compare them with methods of other authors. (en)
Title	Heuristic Methods for Solving a General Dynamic Lot Sizing Problem Heuristic Methods for Solving a General Dynamic Lot Sizing Problem (en)
skos:prefLabel	Heuristic Methods for Solving a General Dynamic Lot Sizing Problem Heuristic Methods for Solving a General Dynamic Lot Sizing Problem (en)
skos:notation	RIV/00216305:26210/05:PU55453!RIV11-MSM-26210___
http://linked.open...avai/riv/aktivita	V Z
http://linked.open...avai/riv/aktivity	V, Z(MSM 261100009)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Dvořák, Jiří Konečný, Pavel Herůdek, Vladimír
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	523232
http://linked.open...ai/riv/idVysledku	RIV/00216305:26210/05:PU55453
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Dynamic lot sizing, multiple constrained resources, stochastic heuristic methods (en)
http://linked.open.../riv/klicoveSlovo	Dynamic lot sizing stochastic heuristic methods multiple constrained resources
http://linked.open...ontrolniKodProRIV	[02EFB974FF7A]
http://linked.open...v/mistoKonaniAkce	Bukurešť
http://linked.open...i/riv/mistoVydani	Bucharest
http://linked.open...i/riv/nazevZdroje	Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005
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...UplatneniVysledku	2005
http://linked.open...iv/tvurceVysledku	Dvořák, Jiří Konečný, Pavel Herůdek, Vladimír
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open.../riv/zahajeniAkce	2005-11-03 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20261100009
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	The Publishing House of Romanian Academy
https://schema.org/isbn	973-27-1254-6
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