Publication detail

Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem

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

Original Title

Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem

Type

conference paper

Language

English

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.

Key words in English

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

Authors

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

RIV year

2002

Released

1. 6. 2002

Publisher

Brno University of Technology

Location

Brno, Czech Republic

ISBN

80-214-2135-5

Book

Proceedings of the 8th International Conference on Soft Computing MENDEL 2002

Pages from

125

Pages to

255

Pages count

131

BibTex

@inproceedings{BUT10556,
  author="Jiří {Dvořák} and Vlastimil {Martinek} and Jan {Král}",
  title="Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem",
  booktitle="Proceedings of the 8th International Conference on Soft Computing MENDEL 2002",
  year="2002",
  pages="131",
  publisher="Brno University of Technology",
  address="Brno, Czech Republic",
  isbn="80-214-2135-5"
}