Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Probability in the engineering and informational sciences
Paper Title
Journal
Date
