Imperial College London
Alternate

Emeritus ProfessorBercRustem

Faculty of Engineering, Department of Computing

Emeritus Professor
 
 
 
//

Contact

 

+44 (0)20 7594 8345b.rustem Website

 
 
//

Assistant

 

Dr Amani El-Kholy +44 (0)20 7594 8220

 
//

Location

 

361Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Wiesemann:2012:10.1007/s10107-011-0478-7,
author = {Wiesemann, W and Kuhn, D and Rustem, B},
doi = {10.1007/s10107-011-0478-7},
journal = {Mathematical Programming},
pages = {437--471},
title = {Robust Resource Allocations in Temporal Networks},
url = {http://dx.doi.org/10.1007/s10107-011-0478-7},
volume = {135},
year = {2012}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations. In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem of selecting an ‘optimal’ resource allocation, where optimality is measured by network characteristics such as the makespan (i.e., the time required to complete all tasks). In this paper we study a robust resource allocation problem where the task durations are uncertain, and the goal is to minimise the worst-case makespan. We show that this problem is generically  -hard. We then develop convergent bounds on the optimal objective value, as well as feasible allocations whose objective values are bracketed by these bounds. Numerical results provide empirical support for the proposed method.
AU  - Wiesemann,W
AU  - Kuhn,D
AU  - Rustem,B
DO  - 10.1007/s10107-011-0478-7
EP  - 471
PY  - 2012///
SP  - 437
TI  - Robust Resource Allocations in Temporal Networks
T2  - Mathematical Programming
UR  - http://dx.doi.org/10.1007/s10107-011-0478-7
VL  - 135
ER  -
Download