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/912

Full metadata record

DC FieldValueLanguage
contributor.authorCaramia, Massimiliano-
contributor.authorBianco, Lucio-
description.abstractIn this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing as precedence constraints the so called “Feeding Precedences” (FP). For the RCPSP with FP we propose a new mathematical formulation and a branch and bound algorithm exploiting the latter formulation. The exact algorithm takes advantage also of a lower bound based on a Lagrangian relaxation of the same formulation. A computational experimentation on randomly generated instances and a comparison with the results achieved by a commercial solver, show that the proposed approach is able to behave satisfactorily.en
format.extent232266 bytes-
relation.ispartofseriesResearch Reporten
subjectbranch and bounden
subjectfeeding precedencesen
subjectLagrangian relaxationen
titleAn Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relationsen
Appears in Collections:Research reports (Enterprise Engineering)

Files in This Item:

File Description SizeFormat
RR_07_09.pdf226KbAdobe PDFView/Open

Show simple item record

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