PROPORTIONAL LOT-SIZING AND SCHEDULING - SOME EXTENSIONS

This contribution generalizes the work of Drexl and Haase about the so -called proportional lot sizing and scheduling problem which was publi shed in 1995. While the early paper considered single-level cases only , the paper at hand describes multilevel problems, i.e., items are int erconnected via a directed network of acyclic precedence constraints, It provides mixed-integer programs for several important extensions wh ich differ in the allocation of resources. A generic solution method i s presented, and following the preceding paper, a randomized regret-ba sed sampling method is tested. A computational study proves that, even for the multilevel case which is far more complex than the single-lev el problem, promising results are obtained. (C) 1998 John Wiley & Sons , Inc.