Learning in stochastic machine scheduling

We consider a scheduling problem in which two classes of independent jobs have to be processed non-preemptively by a single machine. The processing times of the jobs are assumed to be exponentially distributed with parameters depending on the class of each job. The objective is to minimize the sum of expected completion times. We adopt a bayesian framework in which both job class parameters are assumed to be unknown. However, by processing jobs from the corresponding class, the scheduler can gradually learn about the value of these parameters, thereby enhancing the decision making in the future.for the traditional stochastic scheduling variant, in which the parameters are known, the policy that always processes a job with shortest expected processing time (sept) is an optimal policy. In this paper, we show that in the bayesian framework the performance of sept is at most a factor 2 away from the performance of an optimal policy. Furthermore, we introduce a second policy learning-sept (ℓ-sept), which is an adaptive variant of sept. We show that ℓ-sept is no worse than sept and empirically outperforms sept. However, both policies have the same worst-case performance, that is, the bound of 2 is tight for both policies.keywordsschedule problemcompletion timeoptimal policyschedule policyperformance guaranteethese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.