|
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 Field | Value | Language |
|---|
| contributor.author | Caramia, Massimiliano | - |
| contributor.author | Bianco, Lucio | - |
| date.accessioned | 2009-07-07T10:39:18Z | - |
| date.available | 2009-07-07T10:39:18Z | - |
| date.issued | 2009-07-07T10:39:18Z | - |
| identifier.uri | http://hdl.handle.net/2108/912 | - |
| description.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. | en |
| format.extent | 232266 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | en |
| relation.ispartofseries | Research Report | en |
| relation.ispartofseries | RR-07.09 | en |
| subject | branch and bound | en |
| subject | feeding precedences | en |
| subject | Lagrangian relaxation | en |
| title | An Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relations | en |
| type | Report | en |
| Appears in Collections: | Research reports (Enterprise Engineering)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| RR_07_09.pdf | | 226Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
