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). In 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 be...

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the remaining decisions are made dynamically during project execution. The pre-processing decisions entail the addition of precedence constraints to...

A resource investment problem is a project-scheduling problem in which the availability levels of the resources are considered as decision variables and the goal is to find a schedule, and resource requirement levels, such that some objective function optimizes. In this paper, we consider a resource investment problem in which the goal is to maximize the net present value of the project cash fl...

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 ...

A resource investment problem is a project-scheduling problem in which the availability levels of the resources are considered decision variables and the goal is to find a schedule and resource requirement levels such that some objective function optimizes. In this paper, we consider a resource investment problem in which the goal is to maximize the net present value of the project cash flows. ...

Agent technology o€ers a new way of thinking about many of the classic problems in operations research. Among these are problems such as project scheduling subject to resource constraints. In this paper, we develop and experimentally evaluate eight agent-based algorithms for solving the multimode, resource-constrained project scheduling problem. Our algorithms di€er in the priority rules used t...

Obtaining a viable schedule baseline that meets all project constraints is one of the main issues for managers. The literature on this topic focuses mainly methods to obtain schedules meet resource restrictions and, more recently, financial limitations. provide different same project, and solutions with shortest duration are considered best-known project. However, no tools currently select whic...

We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines, it is possible to work in overtime or hire additional capacity in regular time or overtime. For this problem, we develop a two stage heuristic. The key of the approach lies in the first stage in which we construct p...