Publication detail
Heuristic Methods for Solving a General Dynamic Lot Sizing Problem
DVOŘÁK, J. HERŮDEK, V. KONEČNÝ, P.
English title
Heuristic Methods for Solving a General Dynamic Lot Sizing Problem
Type
Paper in proceedings (conference paper)
Language
en
Original abstract
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.
Released
2005-11-01
Publisher
The Publishing House of Romanian Academy
Location
Bucharest
ISBN
973-27-1254-6
Book
Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005
Pages from–to
327–
Pages count
8
BIBTEX
@inproceedings{BUT20757,
author="Jiří {Dvořák} and Vladimír {Herůdek} and Pavel {Konečný}",
title="Heuristic Methods for Solving a General Dynamic Lot Sizing Problem",
booktitle="Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005",
year="2005",
pages="8",
publisher="The Publishing House of Romanian Academy",
address="Bucharest",
isbn="973-27-1254-6"
}