DSpace - Tor Vergata: Item 2108/914

Please use this identifier to cite or link to this item: http://hdl.handle.net/2108/914

Title:	A New Lower Bound for the Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations
Authors:	Bianco, Lucio Caramia, Massimiliano
Keywords:	generalized precedence relationships lower bound project scheduling
Issue Date:	7-Jul-2009
Series/Report no.:	Research Report RR-06.09
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 the those present in the literature
URI:	http://hdl.handle.net/2108/914
Appears in Collections:	Research reports (Enterprise Engineering)

Files in This Item:

File	Description	Size	Format
RR_06_09.pdf		394Kb	Adobe PDF	View/Open