Abstract
A dynamic Printed Circuit Board (PCB) assembly system along with the most complete form of setup time in this assembly is introduced in this paper. An effective Branch-and-Price mechanism is employed to develop a lower bound for the three-machine problem. However, solving the sub problems remains computationally difficult because of their NP-hard nature. An optimal approach is established, which makes solving the sub problems computationally feasible.
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.
