Solving a General Dynamic Lot Sizing Problem with Constrained Resources.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F03%3APU40934" target="_blank" >RIV/00216305:26210/03:PU40934 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving a General Dynamic Lot Sizing Problem with Constrained Resources.
Original language description
This paper deals with a multi-product, multi-stage, dynamic lot sizing problem, with setup costs and multiple constrained resources in a general production-assembly structure. We assume a finite planning horizon, known deterministic demands in each timeperiod, 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 horizon. We propose and compare heuristic methods for solving this problem based on genettic algorithms, simulated annealing and tabu search.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 7th International Research/Expert Conference "Trends in the Development of Machinery and Associated Technology" TMT 2003
ISBN
ISBN 9958-617-1
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
1093-1096
Publisher name
Faculty of Mechanical Engineering in Zenica
Place of publication
Zenica
Event location
Lloret de Mar
Event date
Sep 14, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—