Detail publikace

Solving a Capacitated Dynamic Lot Sizing Problem

MARTINEK, V., DVOŘÁK, J.

Originální název

Solving a Capacitated Dynamic Lot Sizing Problem

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

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

Klíčová slova v angličtině

dynamic lot sizing, general product structure, multiple constrained resources, genetic algorithms

Autoři

MARTINEK, V., DVOŘÁK, J.

Rok RIV

2002

Vydáno

1. 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

Strany od

343

Strany do

686

Strany počet

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",
  pages="344",
  publisher="DAAAM International Vienna",
  address="Vienna, Austria",
  isbn="3/901509-29-1"
}