A NEW ANY-ORDER SCHEDULE GENERATION SCHEME FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING

In this paper, a new schedule generation scheme for resource-constrained project scheduling problems is proposed. Given a project sched-uling problem and a priority rule, a schedule generation scheme determines asingle feasible solution by inserting one by one each activity, according to theirpriority, inside a partial schedule. The paper proposes a generation schemethat differs from the classic ones in the fact that it allows to consider theactivities in any order, whether their predecessors have already been sched-uled or not. Moreover, activity insertion is performed so that delaying somealready scheduled activities is allowed. The paper shows that this strategyremains polynomial and often gives better results than more classic ones.Moreover, it is also interesting in the fact that some priority rules, which arequite poor when used with classic schedule generation schemes, become verycompetitive with the proposed schedule generation scheme