Publication detail

Solving a Capacitated Dynamic Lot Sizing Problem

MARTINEK, V. DVOŘÁK, J.

English title

Solving a Capacitated Dynamic Lot Sizing Problem

Type

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

English abstract

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

Keywords in English

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

RIV year

2002

Released

01.10.2002

Publisher

DAAAM International Vienna

Location

Vienna, Austria

ISBN

3/901509-29-1

Book

In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium

Pages count

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