DSpace - Tor Vergata >
Facoltà di Ingegneria >
Dipartimento di Ingegneria dell'impresa >
Research reports (Enterprise Engineering) >

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

Full metadata record

DC FieldValueLanguage
contributor.authorBianco, Lucio-
contributor.authorCaramia, Massimiliano-
date.accessioned2009-07-07T13:56:14Z-
date.available2009-07-07T13:56:14Z-
date.issued2009-07-07T13:56:14Z-
identifier.urihttp://hdl.handle.net/2108/914-
description.abstractIn 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 literatureen
format.extent404072 bytes-
format.mimetypeapplication/pdf-
language.isoenen
relation.ispartofseriesResearch Reporten
relation.ispartofseriesRR-06.09en
subjectgeneralized precedence relationshipsen
subjectlower bounden
subjectproject schedulingen
titleA New Lower Bound for the Resource-Constrained Project Scheduling Problem with Generalized Precedence Relationsen
typeReporten
Appears in Collections:Research reports (Enterprise Engineering)

Files in This Item:

File Description SizeFormat
RR_06_09.pdf394KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.