Networks

Proportional lot sizing and scheduling: Some extensions

Journal Article

Abstract

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

Related Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.