Abstract
Abstract This paper studies a two-stage assembly problem to minimize the total completion time. The two-stage assembly system consists of multiple machines in the first stage, and an assembly machine in the second stage. Each job consists of multiple components. In the first stage each component is processed on the dedicated machine. In the second stage, the processed components of each job are shipped and assembled into a product on the assembly machine. This system is a generalization of flowshop, which has practical applications in assembly-driven manufacturing. The objective is to establish an efficient schedule minimizing the total completion time. Six lower bounds are proposed and evaluated in a branch-and-bound algorithm. Also, four efficient heuristic algorithms are developed to generate near-optimal schedules. The computational results show that the derived B&B and heuristic algorithms perform very well within reasonable 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.
