The simplest form of the offline makespan minimisation problem is equivalent to packing a number of items of various different sizes into a fixed number of bins, such this.
The maximum bin size needed is as small as possible. The simplest form of the offline makespan minimisation problem is equivalent to packing a number of items of various different sizes into a fixed number of bins. Bins are such this.