Answers are grounded in this paper and cite their sources.
This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.
No takes yet. Share an insight, caveat, or question.
Esther Frostig (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: