Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
The parallel processor scheduling and bin packing problems with contiguity constraints are important in the field of combinatorial optimization because both problems can be used as components of effective exact decomposition approaches for several two-dimensional packing problems. In this study, we provide an extensive review of existing mathematical formulations for the two problems, together with … Read more