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.
Bianco, L., Caramia, M. (2011). A New lower bound for the resource-constrained project scheduling problem with generalized precedence relations. COMPUTERS & OPERATIONS RESEARCH, 38(1), 14-20 [10.1016/j.cor.2009.07.003].
A New lower bound for the resource-constrained project scheduling problem with generalized precedence relations
BIANCO, LUCIO;CARAMIA, MASSIMILIANO
2011-01-01
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
COR3_.pdf
solo utenti autorizzati
Licenza:
Copyright dell'editore
Dimensione
338.16 kB
Formato
Adobe PDF
|
338.16 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
