An integrated scheduling problem of PCB components on sequential pick-and-place machines: Mathematical models and heuristic solutions

Authors:
William Ho;Ping Ji
Affiliations:
Operations and Information Management Group, Aston Business School, Aston University, Birmingham B4 7ET, United Kingdom;Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 4
Cited 4

Sequencing of insertions in printed circuit board assembly

Operations Research
A genetic algorithm for sequential part assignment for PCB assembly

Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Meta-Heuristics: Theory and Applications

Meta-Heuristics: Theory and Applications

Multi-parent extension of partially mapped crossover for combinatorial optimization problems

Expert Systems with Applications: An International Journal
Organizing the operation of radial machine sequencers for multiple PCB types

Computers and Industrial Engineering
Developing a varietal GA with ESMA strategy for solving the pick and place problem in printed circuit board assembly line

Journal of Intelligent Manufacturing
Efficient metaheuristics for pick and place robotic systems optimization

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	12.05

Visualization

Abstract

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-and-place (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.