Component allocation to balance workload in printed circuit card assembly systems |
| |
| Authors: | AMMONS JC CARLYLE M CRANMER L DEPUY G ELLIS K MCGINNIS LF TOVEY CA XU H |
| |
| Affiliation: |
a School of Industrial &Systems Engineering Georgia Institute of Technology, Atlanta, GA, USA
b Department of Operations Research, Stanford University, Stanford, CA, USA
c Ford Motor Company, Dearborn, MI, USA
d Department of Industrial Engineering, University of Louisville, Louisville, KY, USA
e Industrial and Systems Engineering, Virginia Polytechnic Institute and State University Blacksburg, VA, USA
f Motorola, Inc, Arlington Heights, IL, USA |
| |
| Abstract: | Component allocation in printed circuit card assembly systems is a special case of the classical mixed-model assembly line balancing problem and involves assigning component types to machines to achieve specific production objectives. In this paper the component allocation problem is considered for the scenario where there are two or more placement machines (possibly nonidentical) and the objective is to balance, for every card type, a combination of the card assembly time and the machine setup time. A mathematical formulation of the problem is developed for a class of placement machines. Two alternative solution approaches are presented: a list-processing-based heuristic for a simple version of the problem, and a linear-programming-based branch-and-bound procedure for the general component allocation problem. Industrial case study results are presented for each approach that indicate expected throughput improvements of up to 8-10% over the company's current procedure, with much less direct effort required by the process engineer. |
| |
| Keywords: | |
| 本文献已被 InformaWorld SpringerLink 等数据库收录！ |
|
