Multiple Resources

In this chapter we deal with the PLSP—MR. Although some lot sizing models are with multiple resources (e.g. [Der95, He194, Sta88, Sta94]), for solution procedures other than LP—based techniques the single—or multi—machine case is assumed. In Section 8.1 we give an introduction into the resource constrained project scheduling problem (RCPSP) where multiple resources are standard. Then, in Section 8.2, we show how the demand shuffle heuristic can be modified in order to be able to solve the PLSP—MR. Preliminary computational tests are provided in Section 8.3.