We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDP...
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
In this paperweconsidertheproblemof schedulingdifferentclasses of customerson multiple distributed serversto minimize an objective function basedon per-classmeanresponsetimes.This...