Article ID: | iaor20083957 |
Country: | United Kingdom |
Volume: | 18 |
Issue: | 8 |
Start Page Number: | 655 |
End Page Number: | 665 |
Publication Date: | Dec 2007 |
Journal: | Production Planning and Control |
Authors: | Wu Y., Ji P., Ho W. |
Keywords: | scheduling, heuristics: genetic algorithms |
The collect-and-place machine is one of the most widely used placement machines for assembling electronic components on the printed circuit boards (PCBs). Nevertheless, the number of researches concerning the optimisation of the machine performance is very few. This motivates us to study the component scheduling problem for this type of machine with the objective of minimising the total assembly time. The component scheduling problem is an integration of the component sequencing problem, that is, the sequencing of component placements; and the feeder arrangement problem, that is, the assignment of component types to feeders. To solve the component scheduling problem efficiently, a hybrid genetic algorithm is developed in this paper. A numerical example is used to compare the performance of the algorithm with different component grouping approaches and different population sizes.