A heuristic for component switching on SMT placement machines

M. Gronalt; M. Grunow; H. O. Günther; R. Zeller

doi:10.1016/S0925-5273(97)00119-9

A heuristic for component switching on SMT placement machines

M. Gronalt, M. Grunow, H. O. Günther, R. Zeller

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

Abstract

In this paper a heuristic solution procedure is developed to deal with the component switching problem, which arises in printed circuit board assembly. In the first stage of the recursive heuristic, we determine the component set-up for a given sequence of board types to be processed on a single placement machine by applying a modification of the so-called 'keep component needed soonest' policy. In the second stage, component feeders are assigned to slots in the magazine of the placement machine. Recursions to the first stage allow feasible solutions to be generated very fast for all instances of the numerical experiments. These solutions differ only slightly from those obtained for the relaxed problem for which the assignment restrictions are omitted.

Original language	English
Pages (from-to)	181-190
Number of pages	10
Journal	International Journal of Production Economics
Volume	53
Issue number	2
DOIs	https://doi.org/10.1016/S0925-5273(97)00119-9
State	Published - 20 Nov 1997
Externally published	Yes

Keywords

Automated assembly systems
Component set-up
Feeder assignment
Printed circuit board assembly
Surface mount technology (SMT)

Access to Document

10.1016/S0925-5273(97)00119-9

Cite this

@article{72bbfbb9b5ea4974adea53e6942bdc4a,

title = "A heuristic for component switching on SMT placement machines",

abstract = "In this paper a heuristic solution procedure is developed to deal with the component switching problem, which arises in printed circuit board assembly. In the first stage of the recursive heuristic, we determine the component set-up for a given sequence of board types to be processed on a single placement machine by applying a modification of the so-called 'keep component needed soonest' policy. In the second stage, component feeders are assigned to slots in the magazine of the placement machine. Recursions to the first stage allow feasible solutions to be generated very fast for all instances of the numerical experiments. These solutions differ only slightly from those obtained for the relaxed problem for which the assignment restrictions are omitted.",

keywords = "Automated assembly systems, Component set-up, Feeder assignment, Printed circuit board assembly, Surface mount technology (SMT)",

author = "M. Gronalt and M. Grunow and G{\"u}nther, {H. O.} and R. Zeller",

note = "Funding Information: Part of this research was supported by the Austrian Science and Research Foundation (FWF) under the project number P09847-i)TE.",

year = "1997",

month = nov,

day = "20",

doi = "10.1016/S0925-5273(97)00119-9",

language = "English",

volume = "53",

pages = "181--190",

journal = "International Journal of Production Economics",

issn = "0925-5273",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A heuristic for component switching on SMT placement machines

AU - Gronalt, M.

AU - Grunow, M.

AU - Günther, H. O.

AU - Zeller, R.

N1 - Funding Information: Part of this research was supported by the Austrian Science and Research Foundation (FWF) under the project number P09847-i)TE.

PY - 1997/11/20

Y1 - 1997/11/20

N2 - In this paper a heuristic solution procedure is developed to deal with the component switching problem, which arises in printed circuit board assembly. In the first stage of the recursive heuristic, we determine the component set-up for a given sequence of board types to be processed on a single placement machine by applying a modification of the so-called 'keep component needed soonest' policy. In the second stage, component feeders are assigned to slots in the magazine of the placement machine. Recursions to the first stage allow feasible solutions to be generated very fast for all instances of the numerical experiments. These solutions differ only slightly from those obtained for the relaxed problem for which the assignment restrictions are omitted.

AB - In this paper a heuristic solution procedure is developed to deal with the component switching problem, which arises in printed circuit board assembly. In the first stage of the recursive heuristic, we determine the component set-up for a given sequence of board types to be processed on a single placement machine by applying a modification of the so-called 'keep component needed soonest' policy. In the second stage, component feeders are assigned to slots in the magazine of the placement machine. Recursions to the first stage allow feasible solutions to be generated very fast for all instances of the numerical experiments. These solutions differ only slightly from those obtained for the relaxed problem for which the assignment restrictions are omitted.

KW - Automated assembly systems

KW - Component set-up

KW - Feeder assignment

KW - Printed circuit board assembly

KW - Surface mount technology (SMT)

UR - http://www.scopus.com/inward/record.url?scp=0031272825&partnerID=8YFLogxK

U2 - 10.1016/S0925-5273(97)00119-9

DO - 10.1016/S0925-5273(97)00119-9

M3 - Article

AN - SCOPUS:0031272825

SN - 0925-5273

VL - 53

SP - 181

EP - 190

JO - International Journal of Production Economics

JF - International Journal of Production Economics

IS - 2

ER -

A heuristic for component switching on SMT placement machines

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this