Prelegent: prof. Alessandro Agnetis (University of Siena, Włochy)
Miejsce: Sala A1-33/34
Data i godzina: 15 listopada 2012 r., g. 12:00
Abstract: In this talk we address a relatively novel class of scheduling problems, arising in various different contexts, in which jobs are characterized by a certain revenue (if successfully carried out) and a certain chance of success. If a job fails, the corresponding machine is blocked and no further job can be executed. The problem is to allocate and sequence the jobs on m parallel, identical machines in order to maximize expected revenue. For this problem, which is strongly NP-hard, we give some approximation results for the case m=2, and discuss the special case in which machines fail according to an exponentially distributed random process.