سال انتشار: ۱۳۹۱

محل انتشار: نهمین کنفرانس بین المللی مهندسی صنایع

تعداد صفحات: ۱۰

نویسنده(ها):

Ali Shirzadeh Chaleshtari – Sharif University of Technology
Shahram Shadrokh – Sharif University of Technology

چکیده:

In the project scheduling literature, nonrenewable resources are assumed to be available in full amount at the beginning of the project. However, in practice this is not alwaysthe case. In this paper we study this different type of nonrenewable resources which are procured along the projecthorizon according to some pre-scheduled plan. We study anextended form of the resource constrained project scheduling problem (RCPSP) that is subject to this type of nonrenewable resources in addition to the renewable resources (RCPSP-NR). We develop a branch and bound algorithm to solve the RCPSPNR.This algorithm is based on the minimal delaying alternatives algorithm which is a branch and bound approach for solving theRCPSP. We introduce several bounding and fathoming rules to this algorithm to shorten the enumeration process. We point out parameters affecting RCPSP-NR degree of difficulty, generate extensive sets of sample instances for the problem, and perform comprehensive experimental analysis using the customized algorithm and also CPLEX solver. We analyze the algorithm behavior respect to the changes in instances degree of difficulties and compare its performances in different cases with CPLEX solver.