The following pseudocode illustrates how the whole problem can be solved iteratively by translating each arrived request into new activities and constraints. In this pseudocode, AcceptOrNot is a goal which fails if the proposed solution is refused by the customer.

After treating all requests, by simply reading the timetable associated with each unary resource we obtain the required information about the presence on the site of the corresponding worker during the coming month.

However, this proposed method has a major drawback: as new requests are treated, the created activities and constraints are accumulated in the system, thus increasing memory consumption and slowing down general responsiveness.