DSpace - Tor Vergata: Item 2108/912

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

Title:	An Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relations
Authors:	Caramia, Massimiliano Bianco, Lucio
Keywords:	branch and bound feeding precedences Lagrangian relaxation
Issue Date:	7-Jul-2009
Series/Report no.:	Research Report RR-07.09
Abstract:	In 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.
URI:	http://hdl.handle.net/2108/912
Appears in Collections:	Research reports (Enterprise Engineering)

Files in This Item:

File	Description	Size	Format
RR_07_09.pdf		226Kb	Adobe PDF	View/Open