DEMAND SHUFFLE - A METHOD FOR MULTILEVEL PROPORTIONAL LOT-SIZING AND SCHEDULING

This contribution acquaints the reader with a model for multilevel sin gle-machine proportional lot sizing and scheduling problems (PLSPs) th at appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduling, which is of great practical importance. The PL SP model refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the D LSP or the CSLP. A special emphasis is given on a new method called de mand shuffle to solve multilevel PLSP instances efficiently but subopt imally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the pres ented approach decidedly improves recent results. (C) 1997 John Wiley & Sons, Inc.