Abstract
We consider the problem of sequencing n jobs with random processing time on a single machine so as to minimize the expected variance of job completion times. Our main result is a new sufficient condition for an optimal sequence to be V-shaped in terms of the mean processing times when n ⩾ 3. We show that this condition is satisfied by a wide variety of problem instances, including those in which the processing times follow different patterns of distributions. This result relaxes a condition proposed before.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.