In this paper we consider the Project Scheduling Problem with resource constraints, where the objective is to minimize the project makespan. We present a new 0-1 linear programming formulation of the problem that requires an exponential number of variables, corresponding to all feasible subsets of activities that can be simultaneously executed without violating resource or precedence constraints. Different relaxations of the above formulation are used to derive new lower bounds, which dominate the value of the longest path on the precedence graph and are tighter than the bound proposed by Stinson et al. (1978). A tree search algorithm, based on the above formulation, that uses new lower bounds and dominance criteria is also presented. Compu...
This paper reports on results for the well-known resource-constrained project scheduling problem. A ...
We review the most recent lower bounds for the makespan minimization variant of the Resource Constra...
This paper addresses the issue of how to generate problem instances of controlled difficulty. It foc...
In this paper we consider the Project Scheduling Problem with resource constraints, where the object...
: In this paper we consider the Project Scheduling Problem with resource constraints, where the obje...
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) w...
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) w...
In this paper we propose an exact algorithm for the Resource Constrained Project Scheduling Problem ...
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) w...
We propose a novel approach to compute bounds on the objective function value of a wide class of res...
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a ...
This chapter describes the Resource-constrained project scheduling problem as a combinatorial optimi...
We present a novel approach to compute Lagrangian lower bounds on the objective function value of a ...
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a ...
We present an optimal solution procedure for the resource-constrained project scheduling problem (RC...
This paper reports on results for the well-known resource-constrained project scheduling problem. A ...
We review the most recent lower bounds for the makespan minimization variant of the Resource Constra...
This paper addresses the issue of how to generate problem instances of controlled difficulty. It foc...
In this paper we consider the Project Scheduling Problem with resource constraints, where the object...
: In this paper we consider the Project Scheduling Problem with resource constraints, where the obje...
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) w...
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) w...
In this paper we propose an exact algorithm for the Resource Constrained Project Scheduling Problem ...
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) w...
We propose a novel approach to compute bounds on the objective function value of a wide class of res...
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a ...
This chapter describes the Resource-constrained project scheduling problem as a combinatorial optimi...
We present a novel approach to compute Lagrangian lower bounds on the objective function value of a ...
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a ...
We present an optimal solution procedure for the resource-constrained project scheduling problem (RC...
This paper reports on results for the well-known resource-constrained project scheduling problem. A ...
We review the most recent lower bounds for the makespan minimization variant of the Resource Constra...
This paper addresses the issue of how to generate problem instances of controlled difficulty. It foc...