BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Asset-task assignment under execution uncertainty - Stelios Timoth
 eou (University of Cambridge)
DTSTART:20101026T120000Z
DTEND:20101026T130000Z
UID:TALK27466@talks.cam.ac.uk
CONTACT:Derek Gordon Murray
DESCRIPTION:This talk considers a problem associated with the assignment o
 f assets to tasks where each asset can potentially execute any of the task
 s\, but with a probabilistic outcome of success. There is a cost associate
 d with each possible asset-task assignment\, as well as a cost associated 
 with the non-execution of the tasks. We formulate the allocation of assets
  to tasks in order to minimize the overall expected cost\, as a nonlinear 
 combinatorial optimization problem. For its solution\, we propose the use 
 of network flow algorithms which are based on solving a sequence of minimu
 m cost flow problems on appropriately constructed networks with estimated 
 arc costs. Three different schemes for the estimation of the arc costs are
  introduced and their performance is investigated. An approach for obtaini
 ng tight lower bounds to the optimal solution is also developed\, which is
  based on a piecewise linear approximation of the considered problem.
LOCATION:Computer Laboratory\, William Gates Building\, Room FW11
END:VEVENT
END:VCALENDAR