This second house building example shows how to express that activities require a resource in order to be processed. It has the same goal as the previous example: to schedule the tasks to finish the entire house as quickly as possible. More formally, it consists of the same ten activities, some of which must necessarily take place before others (expressed, as before, through precedence constraints), and one worker required by all activities (expressed through resource constraints).

As in the first problem, solving the problem consists of determining the earliest possible end time for the project. That is, assuming a fixed start time, the goal is to find the least possible amount of time that can elapse between the start of the first activity and the end of the last activity. However, now both precedence constraints and resource constraints must be considered. In addition, a search method must be developed, because simply propagating the constraints is not sufficient to find an optimal solution.