%0 Journal Article
%T Multimode Preemptive Resource Investment Problem Subject to Due Dates for Activities: Formulation and Solution Procedure
%A Behrouz Afshar-Nadjafi
%A Mohammad Arani
%J Advances in Operations Research
%D 2014
%I Hindawi Publishing Corporation
%R 10.1155/2014/740670
%X 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. 1. Introduction The resource constrained project scheduling problem (RCPSP) is a known combinatorial optimization problem which is NP-hard [1]. The objective of RCPSP is to minimize the makespan of the project while the renewable resources availabilities are considered given. In the literature there are several exact methods and heuristics that solve the RCPSP [2¨C9]. In the multimode version of the RCPSP (MRCPSP), each activity can be performed in one out of a set of modes, with a specific activity duration and resource requirements. The problem involves the selection of a mode for each activity and the determination of the activity start or finish times such that project makespan is minimized. However, the precedence and resource constraints should be satisfied. MRCPSP is also NP-hard as generalization of the RCPSP. In recent years several algorithms have been proposed to solve MRCPSP [10¨C20]. The resource investment problem (RIP) is a close variant of RCPSP. This problem consists of determination of the activities start times and renewable resources availabilities such that the total cost of the resources is minimized subject to a given project deadline. In RIP, project¡¯s makespan is not forgotten but it is controlled with a predetermined deadline as a constraint. This problem was introduced by M£¿hring [21]. He showed that the problem is NP-hard. Rangaswamy [22] proposed a B&B for the RIP and applied it to the same instance set used by Demeulemeester [23]. Drexl and Kimms proposed two lower bound procedures for the RIP based on Lagrangian relaxation and column generation methods [24]. Other exact procedures are proposed by Demeulemeester [23] and Rodrigues and Yamashita
%U http://www.hindawi.com/journals/aor/2014/740670/