Dynamic Priority-Dynamic Programming Scheduling Method: A dynamic approach to resource constraint project scheduling

A dynamic priority scheduling model developed for solving the resource constraint project scheduling problem is introduced and evaluated and an improvement made upon the first model by cross-breeding dynamic programming with the dynamic priority scheduling model (DPSM) is introduced. The second model, called the dynamic priority dynamic programming scheduling method, aims at optimizing the staged resource allocation decisions in DPSM. DPSM divides a project into phases, the length of which depends on the duration of the project and the period clock cycle selected. The scheduling process starts by allocating resources to the first phase/cycle using a variety of policies, then the best schedule is selected based on an objective function.