سال انتشار: ۱۳۸۳
محل انتشار: سومین کنفرانس ملی مهندسی صنایع
تعداد صفحات: ۱۰
Muhammad Al-Haboubi – Department of Systems Engineering, King Fahad University for Petroleum and Minerals, Dhahran 31261, Saudi Arabia
Saleh Duffuaa – Department of Systems Engineering, King Fahad University for Petroleum and Minerals, Dhahran 31261, Saudi Arabia
This paper presents a new algorithm that provides an optimal solution to the problem of crashing projects with activity duration having nonlinear cost functions. The algorithm is based on a reduced enumeration scheme. It attempts to reduce the search for the optimal solution. The objective is to find the minimum cost of a project having a nonlinear cost function for specified project duration. As a result, the optimum duration
for all activities is determined. Different specified project durations would result in different project costs. Hence, the trade off between project cost and duration is established. A set of theorems that characterize and illustrate the properties of the algorithm have been stated and proven. The significance of the algorithm and the theories is to provide some insight to this difficult problem of time cost trade-off in project scheduling
to elicit further research. Additionally, the user of the algorithm needs not to be familiar with scientific tools such as Linear Programming (LP). An example is solved using LP and the developed algorithm. The usefulness of this work is to enable managers obtain optimal solutions for such problems without resorting to sophisticated techniques that do not even provide exact solutions due to the common practice of approximating nonlinear cost functions by linear functions.