In our first example, resources are not taken into account. The problem simply consists of assigning start and end times to activities, so as to satisfy temporal constraints and minimize a criterion. The criterion to minimize is typically the makespan of the overall schedule, that is, the amount of time between the start of the first activity and the end of the last activity.