In this example, the duration of activities and their resource requirements are fixed. Two or more activities may require the same discrete resource, so they may overlap in time when we schedule them, as long as their combined requirements for the discrete resource do not exceed its capacity.

The problem consists of scheduling the loading of a ship. To our knowledge, this problem was first published in a French operations research book. It consists of 34 activities subject to precedence constraints, as indicated in the following table.

In this example, we'll consider a unique resource, the capacity of which is set to 8. The duration of each activity and the capacity required by each activity are set to the values in the following table.

As in the preceding examples, our goal is to minimize the makespan of the overall schedule, that is, to minimize the total amount of time that elapses between the beginning of the first activity and the end of the last activity.