Article ID: | iaor19991779 |
Country: | United States |
Volume: | 44 |
Issue: | 5 |
Start Page Number: | 714 |
End Page Number: | 729 |
Publication Date: | May 1998 |
Journal: | Management Science |
Authors: | Bianco Lucio, Ricciardelli Salvatore, Mingozzi Aristide, Maniezzo Vittorio |
Keywords: | networks, programming: branch and bound, project management |
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