Detail publikace
Solving a Capacitated Dynamic Lot Sizing Problem
MARTINEK, V. DVOŘÁK, J.
Anglický název
Solving a Capacitated Dynamic Lot Sizing Problem
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
en
Originální abstrakt
This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure. 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 a method for solving this problem based on genetic algorithms
Anglický abstrakt
This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure. 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 a method for solving this problem based on genetic algorithms
Klíčová slova anglicky
dynamic lot sizing, general product structure, multiple constrained resources, genetic algorithms
Rok RIV
2002
Vydáno
01.10.2002
Nakladatel
DAAAM International Vienna
Místo
Vienna, Austria
ISBN
3/901509-29-1
Kniha
In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium
Počet stran
344
BIBTEX
@inproceedings{BUT10558,
author="Vlastimil {Martinek} and Jiří {Dvořák},
title="Solving a Capacitated Dynamic Lot Sizing Problem",
booktitle="In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium",
year="2002",
month="October",
publisher="DAAAM International Vienna",
address="Vienna, Austria",
isbn="3/901509-29-1"
}