A genetic algorithm approach to scheduling PCBs on a single machine

摘要

This paper addresses the problem of scheduling N printed circuit boards (PCBs) on a single machine equipped with an automatic component interchange mechan- ism. 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.