On comparison of the strip packing problem with a certain project scheduling problem

Comparison of some particular case of the resource-constrained project scheduling problem with the strip packing problem is performed. The upper bound for the optima relation of these problems is improved. An example with the optima 5 and 4 and the strip width 8 is constructed. It is shown that this example is minimal, i.e., there exist no example with optima 5 and 4 and with less width of the strip. Illustr. 11, bibl. 9.