Abstract
This paper addresses the problem of scheduling N printed circuit boards (PCBs) on a single machine equipped with an automatic component interchange mechanism. Assume that the total number of different components required to process all N PCBs is greater than the capacity of the spool. If the requisite components are not on the spool, then one or more component switches must occur before the PCB can be processed. The problem consists of finding the order to schedule the PCBs on the axial insertion machine and the components to place on the spool before each PCB is processed. The performance criterion is to minimize the total number of component switches. This problem is addressed employing a genetic algorithm to search the space of alternative solutions. To evaluate the performance of the GA, a heuristic solution based on a travelling salesman formulation is described. Extensive experiments were carried out for both approaches based on data extracted from industrial scenes.
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.
