Abstract
The scheduling problem of LED chip sorting workstation is a multiprocessor open shop scheduling problem which is categorized as a NP-hard problem. In practice, this problem is usually solved with finding a dispatching rule to achieve certain performance indices through simulation. To find the most effective rule from five proposed dispatching rules was considered in this study. Experimental design was applied to find significant factors, and a two-stage process was used to select the best dispatching rule. In the first stage, where make-span as the performance index, three dispatching rules are selected for the next stage comparison, and they are common in applying LPT in bottleneck machines. In the second stage, a dispatching rule with applying SPT in non-bottleneck machines has least average queuing time among those three, and this rule is recommended for practical application.
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.
