Detail publikace

Heuristic Methods for Solving a General Dynamic Lot Sizing Problem

DVOŘÁK, J. HERŮDEK, V. KONEČNÝ, P.

Anglický název

Heuristic Methods for Solving a General Dynamic Lot Sizing Problem

Typ

Stať ve sborníku v databázi WoS či 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 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.

Vydáno

2005-11-01

Nakladatel

The Publishing House of Romanian Academy

Místo

Bucharest

ISBN

973-27-1254-6

Kniha

Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005

Strany od–do

327–

Počet stran

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"
}