Scheduling in the Face of Uncertain Resource Consumption and Utility

We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We show that the problems are NP-complete, and present some results that characterize the behavior of some simple heuristics over a variety of problem classes.

• Type: Conference
• Year: 2003
• Where: CP
• Authors: Jeremy Frank, Richard Dearden
• Keywords: CP 2003, Expected Utility, Programming Languages, Uncertain Amounts, Uncertain Utility