This paper describes a new technique for solving the duration minimization in a resourceconstrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial natur...

Resource-constrained project scheduling problems are one of the most studied scheduling problem, and constraint programming with nogood learning provides the state-of-the-art solving technology for them, at least when the aim is minimizing makespan. In this paper we examine the closely related problem of scheduling producers and consumers of discrete resources and reservoirs. Producer/consumer ...

The Over-Constrained Scheduling Model (OCSM) is introduced as a way to accommodate negotiation in over-constrained, distributed scheduling problems. The OCSM is appropriate for negotiation among a group of peers and is also applicable to a manager that must balance conflicting views of its workers. The distributed scheduling algorithm that is used selects a candidate from the priority list of r...

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

We study resource-constrained project scheduling problems with perturbation on activity durations. With the consideration of robustness and stability of a schedule, we model the problem as a multiobjective optimization problem. Three objectives—makespan minimization, robustness maximization, and stability maximization—are simultaneously considered. We propose a hybrid multiobjective evolutionar...

This paper addresses an extension of the resource-constrained project scheduling problem that takes into account storage resources which may be produced or consumed by activities. To solve this problem, we propose the generalization of two existing mixed integer linear programming models for the classical resource-constrained project scheduling problem, as well as one novel formulation based on...

In practice, organizations work in general on more than one project which share some or all the available resources. In this work hybrid heuristics that combine Random Sampling heuristics and Backward-Forward methods are developed for the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP). This heuristic approach has been successfully applied to resource-constrained single project s...

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...

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