A Branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool

Sun, Dong-Seok; Lee, Tae-Eog

doi:10.1007/s00291-007-0085-4

Cited by 9 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The heads are sequentially arranged on a beam or a rotating wheel at the gantry robot. The former is called beam-type while the latter is called collect-and-place type [3]. Both types of these machines can have single or multiple arms.…”

Section: Introductionmentioning

confidence: 99%

“…The authors claimed that their proposed genetic algorithms are very efficient in terms of computational time, especially if adequate coding schemes are used. Recently, Sun and Lee [3] developed a branch-and-price procedure for a placement routing problem for a beam-type multi-head placement machine. They formulated the problem as an integer programming model with a huge number of variables.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Multi-Objective Optimization Approach for Multi-Head Beam-Type Placement Machines

Torabi

Ashayeri²

2010

SSRN Journal

View full text Add to dashboard Cite

This paper addresses a highly challenging scheduling problem in the field of printed circuit board (PCB) assembly systems using Surface Mounting Devices (SMD). After describing some challenging optimization sub-problems relating to the heads of multi-head surface mounting placement machines, we formulate an integrated multi-objective mathematical model considering of two main sub-problems simultaneously. The proposed model is a mixed integer nonlinear programming one which is very complex to be solved optimally. Therefore, it is first converted into a linearized model and then solved using an efficient multi-objective approach, i.e., the augmented epsilon constraint method. An illustrative example is also provided to show the usefulness and applicability of the proposed model and solution method.Keywords PCB assembly . Multi-head beam-type placement machine . Multi-objective mathematical programming . Augmented epsilon-constraint method

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Multi-Objective Optimization Approach for Multi-Head Beam-Type Placement Machines

Torabi

Ashayeri²

2010

SSRN Journal

View full text Add to dashboard Cite

show abstract

Simulation of mixed-model PCB assembly lines with group setup and bypass conveyors

Yılmaz

Günther

Jain

2008

Int J Adv Manuf Technol

View full text Add to dashboard Cite

PCB assembly scheduling with alternative nozzle types for one component type

2011

View full text Add to dashboard Cite

The placement machine is the bottleneck of a printed circuit board (PCB) assembly line. The type of machine considered in this paper is the beam-type placement machine that can simultaneously pick up several components from feeders. It is assumed that the number of nozzle types (NTs) is less than the number of heads on the beam. The objective of the PCB assembly scheduling for a single placement machine is to minimize the cycle time based on the average machine operation time instead of the travelling distance. To minimize the cycle time, the number of turns and the number of pickups should be minimized. The PCB assembly scheduling is hierarchically decomposed into four problems: the nozzle assignment problem, the head allocation problem, the component type (CT) grouping problem and the pickup clustering problem, which are optimized successively and iteratively. First, the nozzle assignment problem considering alternative NTs for one CT is dealt with by the proposed genetic algorithm. For a given nozzle assignment solution, the head allocation problem is solved by a previously greedy heuristic to minimize the number of turns.Then, the CT grouping problem and the pickup clustering problem are solved by a proposed greedy heuristic and a modified agglomerative hierarchical clustering approach, respectively, to minimize the number of pickups. Numerical experiments are carried out to examine the performances of these proposed heuristic approaches. The importance of considering alternative NTs for one CT for the cycle time is also confirmed.

show abstract

A Branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool

Cited by 9 publications

References 19 publications

A Multi-Objective Optimization Approach for Multi-Head Beam-Type Placement Machines

A Multi-Objective Optimization Approach for Multi-Head Beam-Type Placement Machines

Simulation of mixed-model PCB assembly lines with group setup and bypass conveyors

PCB assembly scheduling with alternative nozzle types for one component type

Contact Info

Product

Resources

About