Abstract
Given a set of n jobs with independent random processing times and the same start times, the problem is to find the optimal processing time multiple k* for the total work content due-date assignment method, and the optimal sequence π* to minimize the expected total amount of missed due-dates. It is shown that k* is a constant for a given job set. Although in general π* cannot be determined analytically, it is shown that, under certain circumstances, π* should be in shortest-expected-processing-time sequence to minimize the objective function.
Sign-in/Register to access full text options 
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.
