In this paper we present a general framework for stochastic one-machine scheduling problems with zero release times and no partial ordering and review and extend some of the results for nonpreemptive permutation schedules recently obtained for these models.
No takes yet. Share an insight, caveat, or question.
J. B. G. Frenk (1991) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: