Answers are grounded in this paper and cite their sources.
This paper considers a single machine andnjobs. The machine is subject to breakdown and repair. Jobjhas a weightwj, a random processing timeXj, and is available for processing from a random timeRjon. The jobs may be subject to precedence constraints. We are interested in optimal policies that minimize the following objective functions: (i) the weighted sum of the completion times; (ii) the weighted sum of an exponential function of the completion times; and (iii) the weighted number of late jobs having due dates.
No takes yet. Share an insight, caveat, or question.
Pinedo et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: