CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishIn 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.
Bianco, L., & Caramia, M. (2009). An Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relations.
| Tipologia: | Altro | |
| Citazione: | Bianco, L., & Caramia, M. (2009). An Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relations. | |
| Lingua: | en | |
| Data di pubblicazione: | 7-lug-2009 | |
| Titolo: | An Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relations | |
| Autori: | Bianco, Lucio;Caramia, Massimiliano | |
| Autori: | ||
| Appare nelle tipologie: | 99 - Altro |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| RR_07_09.pdf | N/A | Open Access Visualizza/Apri |
Copyright © 2021