1996
DOI: 10.1142/s0960313196000172
|View full text |Cite
|
Sign up to set email alerts
|

SMT Feeder Slot Assignment for Predetermined Component Placement Paths

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2002
2002
2013
2013

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…Similarly, when optimising component pick-and-place sequencing, other optimisation problems such as a feeder setup should be solved in a simple manner or assume they have already been solved. For example, Leipa¨la¨and Nevalainen (1989), Moyer and Gupta (1996a) and Dikos, Nelson, Tirpak and Wang (1997) solved the feeder setup problem based on the assumption that the placement sequence was predetermined or fixed.…”
Section: Feeder Setup Optimisationmentioning
confidence: 99%
See 2 more Smart Citations
“…Similarly, when optimising component pick-and-place sequencing, other optimisation problems such as a feeder setup should be solved in a simple manner or assume they have already been solved. For example, Leipa¨la¨and Nevalainen (1989), Moyer and Gupta (1996a) and Dikos, Nelson, Tirpak and Wang (1997) solved the feeder setup problem based on the assumption that the placement sequence was predetermined or fixed.…”
Section: Feeder Setup Optimisationmentioning
confidence: 99%
“…Based on the predetermined component placement sequence, Moyer and Gupta (1996a) solved the feeder setup of turret-type placement machines by assigning component feeders to slots based on the switching between component types. Next, they improve the solution by exchanging pairs of slots.…”
Section: Feeder Setup Optimisationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, many of them focused on the individual problems for the machine. Some researchers [4,5] studied the component sequencing problem only, whereas some researchers [6][7][8] worked on the feeder arrangement problem alone. Similarly, Crama et al [9] also investigated the component retrieval problem merely for a chip shooter machine.…”
Section: Literature Reviewmentioning
confidence: 99%
“…5 Next, they proposed a heuristic they called the Acyclic Assembly Time (AAT) Algorithm for determining the component placement sequence for implementation by a type of assembly machine known as a High Speed Chip Shooter. 6 A subsequent work presented another heuristic for this problem, along with detailed numerical experiments.…”
Section: Introductionmentioning
confidence: 99%