Abstract
A set of stochastic jobs is to be processed on a single machine which is subject to breakdowns and repairs. Under quite general conditions on the job's processing times, the uptimes and the repairtimes of the machine, we find a simple optimal permutation policy for the weighted sum of an increasing function of the completion times. Some optimal policies for two special cases, which have not been investigated in the literature, are given. Moreover, an upper bound is established on the loss incurred when a processing policy is adopted under a simplifying assumption of exponential processing requirements
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
