Packing problems and project scheduling models: an integrating perspective

This paper considers two problem classes, namely packing and project schedu ling problems that are important to researchers as well as practitioners. T he two problem categories are described, and a classification is given for the different kinds of packing problems and project scheduling concepts. Wh ile both problem classes are different with respect to their fields of appl ication, similarities of their mathematical structures are examined. It is shown that all packing problems considered here are special cases of models for project scheduling. The aim is to indicate which project scheduling mo dels can be used to capture the different types of packing problems. Finall y, some implications for research on optimisation algorithms for these two problem classes are discussed, and the applicability of the results of this work in practice are pointed out.