Premium
Proportional lot sizing and scheduling: Some extensions
Author(s) -
Kimms A.,
Drexl A.
Publication year - 1998
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199809)32:2<85::aid-net2>3.0.co;2-e
Subject(s) - sizing , regret , scheduling (production processes) , computer science , mathematical optimization , integer programming , operations research , mathematics , machine learning , art , visual arts
This contribution generalizes the work of Drexl and Haase about the so‐called proportional lot sizing and scheduling problem which was published in 1995. While the early paper considered single‐level cases only, the paper at hand describes multilevel problems, i.e., items are interconnected via a directed network of acyclic precedence constraints. It provides mixed‐integer programs for several important extensions which differ in the allocation of resources. A generic solution method is presented, and following the preceding paper, a randomized regret‐based sampling method is tested. A computational study proves that, even for the multilevel case which is far more complex than the single‐level problem, promising results are obtained. © 1998 John Wiley & Sons, Inc. Networks 32: 85–101, 1998