Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
476041 | Computers & Operations Research | 2011 | 7 Pages |
Abstract
In this paper we propose a new lower bound for the resource-constrained project scheduling problem with generalized precedence relationships. The lower bound is based on a relaxation of the resource constraints among independent activities and on a solution of the relaxed problem suitably represented by means of an AON acyclic network. Computational results are presented and confirmed a better practical performance of the proposed method with respect to those present in the literature.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Lucio Bianco, Massimiliano Caramia,