Abstract
We consider a two-machine flowshop scheduling problem where machines are subject to random breakdowns. We define the stochastic machine dominance problem and suggest five rules for finding the makespan. We use simulation to find the performance of these five rules. Out of these five rules, one rule seems to perform well when machine 1 stochastically dominates machine 2, whereas when machine 2 stochastically dominates machine 1 another rule is found to be good. The results of the experimentation reveal that when uptimes and downtimes follow exponential distributions. Talwar rule performs well. The results of the experimentation also reveal that Johnson rule's performance is not that bad when machines break down.
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.
