Abstract
In this paper, we researched a one-of-a-kind assembly production system where every product is unique (i.e. each product has its unique tree-like process route) and arrives one by one randomly with the exponentially distributed inter arrival times. We proposed a new effective combined dispatching rule (LFD/RPS/CP rule) that is constructed by considering three factors: the latest finishing date (LFD), the remaining path size (RPS) and whether an operation is on the critical path (CP). We did many numerical experiments to compare the efficiency between the proposed rule and other rules that were reported in existing studies such as LFD rule and EDD rule. The performance analysis shows that the proposed dispatching rule is more effective in reducing the number of tardy products and total tardiness time.
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.
