Project Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources


  • Azad Amiri Industrial Engineering, University of Kurdistan
  • Farid Abdi Industrial Engineering, University of Kurdistan

Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem as a multi-objective planning problem, the present study aims at minimizing the project completion time as well as maximizing the net present value and project flexibility by taking into account the resource constraints and precedence relations. Here the flexibility of project is calculated by considering a free float for each activity and maximizing the sum of these flotation times. Although most of the researches considered the resources as non-renewable resources, here the resources are considered as renewable ones. Moreover, performing each activity may be possible in various states of using resources (mode) which can change the project completion time and cost. Owing to the complexity of the problem, the Multi Objective Simulated Annealing Meta-heuristic Algorithm is used to solve the proposed model. In doing so, first a feasible answers is proposed and then, using the aforementioned algorithm, it was attempted to find Pareto answers. For accrediting the algorithm, four benchmark problems have been considered. Since the algorithm performed well in finding the optimal answers to the benchmark problems, it was used to find the optimal answer of large scale problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splittable stochastic project scheduling with constrained renewable resource

This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The ...

متن کامل

Project scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study

Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...

متن کامل

Project Portfolio Selection with the Maximization of Net Present Value

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...

متن کامل

Maximising the Net Present Value for Resource-Constrained Project Scheduling

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow...

متن کامل

Time-constrained project scheduling with adjacent resources

We develop a decomposition method for project scheduling problems with adjacent resources. Adjacent resources are resources for which the units assigned to a job are required to be in some sense adjacent. Possible examples of adjacent resources are dry docks, shop floor spaces, and assembly areas. We focus on the Time-Constrained Project Scheduling Problem (TCPSP), [4], with one 1-dimensional a...

متن کامل

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

متن کامل

ذخیره در منابع من

ذخیره در منابع من ذخیره شده در منابع من

{@ msg_add @}

  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 31  شماره 5

صفحات  780- 791

تاریخ انتشار 2018-05-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

copyright © 2015-2021