This article presents the resource-constrained project scheduling problem with discounted cash flow maximization criterion from perspective of a contractor. Cash flows are considered as contractor’s expenses related to execution activities and client’s payments (revenue contractor) after completion contractual stages. To solve problem, dedicated techniques generate solutions simulated annealing...

Abstract—Resource –constrained project scheduling problem (RCPSP) is a well known NP hard problem. This paper proposes a hybrid approach of constraint programming (CP) and integer programming (IP) which could solve RCPSP with ideal efficiency and quality. Constraint propagation is key element of constraint programming and is widely used in cumulative resource problem (CRP). CRP can be taken as ...

We consider the resource-constrained activity insertion problem with minimum and maximum time lags. The problem consists in inserting a single activity in a partial schedule while preserving its structure represented through resource flow networks and minimizing the makespan increase caused by the insertion. In the general case, we show that finding a feasible insertion that minimizes the proje...

This paper presents a set of satisfiability tests and time-bound adjustment algorithms that can be applied to cumulative scheduling problems. An instance of the Cumulative Scheduling Problem (CuSP) consists of (1) one resource with a given capacity and (2) a set of activities, each having a release date, a deadline, a processing time and a resource capacity requirement. The problem is to decide...

This paper presents a set of satisfiability tests and time-bound adjustment algorithms that can be applied to cumulative scheduling problems. An instance of the Cumulative Scheduling Problem (CuSP) consists of (1) one resource with a given capacity and (2) a set of activities, each having a release date, a deadline, a processing time and a resource capacity requirement for each activity. The pr...

This paper presents a set of satisfiability tests and time-bound adjustment algorithms that can be applied to cumulative scheduling problems. An instance of the Cumulative Scheduling Problem (CuSP) consists of (1) one resource with a given capacity and (2) a set of activities, each having a release date, a deadline, a processing time and a resource capacity requirement. The problem is to decide...