Resource Constrained Project Scheduling Subject to Due Dates : Preemption Permitted with Penalty

Abstract EN

Extensive research works have been carried out in resource constrained project scheduling problem.

However, scarce researches have studied the problems in which a setup cost must be incurred if activities are preempted.

In this research, we investigate the resource constrained project scheduling problem to minimize the total project cost, considering earliness-tardiness and preemption penalties.

A mixed integer programming formulation is proposed for the problem.

The resulting problem is NP-hard.

So, we try to obtain a satisfying solution using simulated annealing (SA) algorithm.

The efficiency of the proposed algorithm is tested based on 150 randomly produced examples.

Statistical comparison in terms of the computational times and objective function indicates that the proposed algorithm is efficient and effective.