Abstract
In this paper we consider one-machine scheduling problems with or without a perfect machine and random processing times and derive among other results elimination criteria for different classes of cost functions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
