- -

A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags

Show full item record

Ponz Tienda, JL.; Salcedo-Bernal, A.; Pellicer Armiñana, E. (2017). A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags. COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING. 32:474-498. doi:10.1111/mice.12233

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/89690

Files in this item

Item Metadata

Title: A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Construcciones Arquitectónicas - Departament de Construccions Arquitectòniques
Universitat Politècnica de València. Departamento de Ingeniería de la Construcción y de Proyectos de Ingeniería Civil - Departament d'Enginyeria de la Construcció i de Projectes d'Enginyeria Civil
Issued date:
Abstract:
[EN] The efficient use of resources is a key factor to minimize the cost while meeting time deadlines and quality requirements; this is especially important in construction projects where field operations take fluctuations ...[+]
Copyrigths: Reserva de todos los derechos
Source:
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING. (issn: 1093-9687 )
DOI: 10.1111/mice.12233
Publisher version: http:dx.doi.org/10.1111/mice.12233
Thanks:
This research was supported by the FAPA program of the Universidad de Los Andes (Colombia). The authors would like to thank the research group of Construction Engineering and Management (INgeco), especially J. S. Rojas-Quintero, ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record