Multimode Preemptive Resource Investment Problem Subject to Due Dates for Activities: Formulation and Solution Procedure

Abstract EN

The preemptive Multimode resource investment problem is investigated.

The Objective is to minimize the total renewable/nonrenewable resource costs and earliness-tardiness costs by a given project deadline and due dates for activities.

In this problem setting preemption is allowed with no setup cost or time.

The project contains activities interrelated by finish-start type precedence relations with a time lag of zero, which require a set of renewable and nonrenewable resources.

The problem formed in this way is an NP-hard.

A mixed integer programming formulation is proposed for the problem and parameters tuned genetic algorithm (GA) is proposed to solve it.

To evaluate the performance of the proposed algorithm, 120 test problems are used.

Comparative statistical results reveal that the proposed GA is efficient and effective in terms of the objective function and computational times.