Abstract
This paper considers scheduling n jobs on a single machine where the job processing times and due dates are independent random variables with arbitrary distribution functions. We consider the case that the weighted job tardiness in expectation is minimized. It is assumed that job’s due dates are compatible with processing times and weights. We show that the jobs should be sequenced in decreasing stochastic order of their due dates.
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: Journal of Systems Science and Systems Engineering
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.
