Answers are grounded in this paper and cite their sources.
The D.A.I. theorem of Gittins and Jones has proved a powerful tool in solving sequential statistical problems. A generalisation of this theorem is presented. This generalisation enables us to solve certain stochastic scheduling problems where the items or jobs to be scheduled have random times to completion, the random times having distributions dependent upon parameters to which prior distributions are allocated. Such problems are of interest in many areas where scheduling is important.
No takes yet. Share an insight, caveat, or question.
Gittins et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: