Abstract

Longest Expected processing time (LEPT) policy is a machine loading rule where out of all the jobs waiting to be processed by a machine, with their processing times following given probability distributions, the one with the largest expected processing time is chosen first. Using a method based on Markov process and dynamic programming, we show that a LEPT policy will minimize the expected makespan for a two-machine stochastic open shop with Poisson arrival for jobs. Processing time of any job at any machine is exponential. We assume that all jobs are identical but the two machines are not.

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 call

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.