This paper formulates several mathematical models for determining the optimal sequence of component placements and assignment of component types to feeders simultaneously or the integrated scheduling problem for a type of surface mount technology placement machines, called the sequential pick-andplace (PAP) machine. A PAP machine has multiple stationary feeders storing components, a stationary working table holding a printed circuit board (PCB), and a movable placement head to pick up components from feeders and place them to a board. The objective of integrated problem is to minimize the total distance traveled by the placement head. Two integer nonlinear programming models are formulated first. Then, each of them is equivalently converted into an integer linear type. The models for the integrated problem are verified by two commercial packages. In addition, a hybrid genetic algorithm previously developed by the authors is adopted to solve the models. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total traveling distance.
- printed circuit board manufacturing
- surface mount technology
- component sequencing
- feeder arrangement
- mathematical modeling
- genetic algorithm
Ho, W., & Ji, P. (2009). An integrated scheduling problem of PCB components on sequential pick-and-place machines: mathematical models and heuristic solutions. Expert Systems with Applications, 36(3 Part 2), 7002-7010. https://doi.org/10.1016/j.eswa.2008.08.025