Array
(
    [typ] => PU
    [page_title_red] => Detail publikace
    [released] => 2007-09-01
    [language] => en
    [bibtex] => @inproceedings{BUT26399,
  author="Vladimír {Herůdek} and Jiří {Dvořák}",
  title="Dynamic Lot Sizing under Stochastic Demands",
  booktitle="Stoptima - Mozaic 2007",
  year="2007",
  number="1",
  pages="37--42",
  publisher="Vysoké učení technické v Brně",
  address="Brno",
  isbn="978-80-214-3474-5"
}
    [title_orig] => Dynamic Lot Sizing under Stochastic Demands
    [abstract_orig] => 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 successors. We assume a finite planning horizon consisting of discrete time periods, dynamic lot sizes, multiple constrained resources, time-varying cost parameters and stochastic demands. The objective is to minimize the sum of total production and setup costs and mean values of holding costs and backorder penalty costs. The paper describes a mathematical model of this problem and proposes a solution method based on genetic algorithm.
    [title_cs] => 
    [title_en] => Dynamic Lot Sizing under Stochastic Demands
    [keywords_cs] => 
    [keywords_en] => Dynamic lot sizes, general product structure, stochastic demands, genetic algorithm
    [pub_type] => Stať ve sborníku v databázi WoS či Scopus
    [quotations] => HERŮDEK, V.; DVOŘÁK, J.
    [publisher] => Vysoké učení technické v Brně
    [location] => Brno
    [issn] => 
    [isbn] => 978-80-214-3474-5
    [volume] => 
    [number] => 
    [pages] => 6
    [book] => Stoptima – Mozaic 2007
    [journal] => 
    [page_from_to] => 37–42
)

Detail publikace

Dynamic Lot Sizing under Stochastic Demands

HERŮDEK, V. DVOŘÁK, J.

Anglický název

Dynamic Lot Sizing under Stochastic Demands

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 successors. We assume a finite planning horizon consisting of discrete time periods, dynamic lot sizes, multiple constrained resources, time-varying cost parameters and stochastic demands. The objective is to minimize the sum of total production and setup costs and mean values of holding costs and backorder penalty costs. The paper describes a mathematical model of this problem and proposes a solution method based on genetic algorithm.

Klíčová slova anglicky

Dynamic lot sizes, general product structure, stochastic demands, genetic algorithm

Vydáno

2007-09-01

Nakladatel

Vysoké učení technické v Brně

Místo

Brno

ISBN

978-80-214-3474-5

Kniha

Stoptima – Mozaic 2007

Strany od–do

37–42

Počet stran

6

BIBTEX


@inproceedings{BUT26399,
  author="Vladimír {Herůdek} and Jiří {Dvořák}",
  title="Dynamic Lot Sizing under Stochastic Demands",
  booktitle="Stoptima - Mozaic 2007",
  year="2007",
  number="1",
  pages="37--42",
  publisher="Vysoké učení technické v Brně",
  address="Brno",
  isbn="978-80-214-3474-5"
}