A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations |
| |
Authors: | Lucio Bianco Massimiliano Caramia |
| |
Affiliation: | Dipartimento di Ingegneria dell’Impresa, Via del Politecnico, 1 00133 Roma, Italy |
| |
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: | Generalized precedence relationships Lower bound Project scheduling |
本文献已被 ScienceDirect 等数据库收录! |