An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems | Journal of Heuristics Skip to main content
Springer Nature Link
Log in

An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Component allocation is an important element of process planning for printed circuit card assembly systems. The component allocation problem directly impacts the productivity and cost of a circuit card assembly system. Many companies have recognized the importance of component allocation and have started to develop a better decision process. Also, a few commercial software packages have been developed that provide environments to support process planning. However, optimization methods are not yet widely used. We demonstrate that component allocation is amenable to improvement using optimization methods. We present an integer programming heuristic for the component allocation problem and report on several case studies that have been conducted and that demonstrate its effectiveness. The heuristic is based on a mixed integer programming formulation of the component allocation problem that incorporates estimates of downstream process planning decisions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Ahmadi, J., R. Ahmadi, M. Hirofumi, and D. Tirupati. (1995). “Component Fixture Positioning/Sequencing for Printed Circuit Card Assembly with Concurrent Operations.” Operations Research 43, 444–457.

    Google Scholar 

  • Ahmadi, J., S. Grotzinger, and D. Johnson. (1988). “Component Allocation and Partitioning for Dual Delivery Placement Machine.” Operations Research 36, 176–191.

    Google Scholar 

  • Ahmadi, R. and P. Kouvelis. (1994). “Staging Problem of a Dual Delivery Pick-and-Place Machine in Printed Circuit Assembly.” Operations Research 42, 81–91.

    Google Scholar 

  • Ammons, J.C., M. Carlyle, L. Cranmer, G.W. DePuy, K.P. Ellis, L.F. McGinnis, C.A. Tovey, and H. Xu. (1997). “Component Allocation to BalanceWorkload in Printed Circuit Card Assembly Systems.” IIE Transactions 29, 265–275.

    Google Scholar 

  • Ammons, J.C., M. Carlyle, G.W. DePuy, K.P. Ellis, L.F. McGinnis, C.A. Tovey, and H. Xu. (1992). “Computer Aided Process Planning in Printed Circuit Card Assembly.” Proceedings of International Electronics Manufacturing Technology Symposium. Baltimore, Maryland, September 28–30.

  • Ammons, J.C., M. Carlyle, G.W. DePuy, K.P. Ellis, L.F. McGinnis, C.A. Tovey, and H. Xu. (1993). “Computer Aided Process Planning in Printed Circuit Card Assembly.” IEEE Transactions on Components, Hybrids, and Manufacturing Technology 16, 370–376.

    Google Scholar 

  • Askin, R.G., M. Dror, and A.J. Vakharia. (1994). “Printed Circuit Card Family Grouping and Component Allocation for a Multimachine, Open-Shop Assembly Cell.” Naval Research Logistics 41, 587–608.

    Google Scholar 

  • Ball, M.O. and M.J. Magazine. (1988). “Sequencing of Insertions in Printed Circuit Card Assembly.” Operations Research 36, 192–201.

    Google Scholar 

  • Ben-Arieh, D. and M. Dror. (1990). “Part Assignment to Electronic Insertion Machines: Two Machine Case.” International Journal of Production Research 28, 1317–1327.

    Google Scholar 

  • Berrada, M. and K.E. Stecke. (1986). “A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems.” Management Science 32, 1316–1335.

    Google Scholar 

  • Carmon, T.F., O.Z. Maimon, and E.M. Dar-El. (1989). “Group Set-Up for Printed Circuit Card Assembly.” International Journal of Production Research 27, 1795–1810.

    Google Scholar 

  • Crama, Y., O.E. Flippo, J. van de Klundert, and F.C.R. Spieksma. (1997). “The Assembly of Printed Circuit Boards: A Case with Multiple Machines and Multiple Board Types.” European Journal of Operations Research 98, 457–472.

    Google Scholar 

  • Crama, Y., A.W.J. Kolen, A.G. Oerlemans, and F.C.R. Spieksma. (1990). “Throughput Rate Optimization in the Automated Assembly of Printed Circuit Cards.” Annals of Operations Research 26, 455–480.

    Google Scholar 

  • DePuy, G.W. (1995). “Component Allocation to Balance Workload in Printed Circuit Card Assembly Systems.” Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, Georgia.

    Google Scholar 

  • DePuy, G.W., J.C. Ammons, and L.F. McGinnis. (1997). “Formulation of a General Component Allocation Model for Printed Circuit Card Assembly Systems.” Proceedings of the 1997 Sixth Industrial Engineering Research Conference. Miami, Florida, May 17–18.

  • Gavish, B. and A. Seidmann. (1987). “Printed Circuit Cards Assembly Automation—Formulations and Algorithms.” Proceedings of IXth International Conference on Production Research. Cincinnati, Ohio, pp. 662–673.

  • Grotzinger, S. (1988). Positioning for a Dual Delivery Placement Machine. Yorktown Heights, New York: IBM Research Division, T.J. Watson Research Center.

    Google Scholar 

  • Grotzinger, S. (1992). “Feeder Assignment Models for Concurrent Placement Machines.” IIE Transactions 24, 31–46.

    Google Scholar 

  • Hillier, M.S. and M.L. Brandeau. (1993). “Optimal Operation Assignment and Production Grouping in Printed Circuit Card Manufacturing.” Working Paper, Department of Industrial Engineering and Engineering Management, Stanford University.

  • Leipala, T. and O. Nevalainen. (1989). “Optimization of the Movements of a Component Placement Machine.” European Journal of Operations Research 38, 167–177.

    Google Scholar 

  • Lofgren, C.B. and L.F. McGinnis. (1986). “Soft Configuration in Automated Insertion.” Proceeding of the 1986 IEEE Conference on Robotics and Automation. San Francisco, California.

  • McGinnis, L.F., J.C. Ammons, M. Carlyle, L. Cranmer, G.W. DePuy, K.P. Ellis, C.A. Tovey, and H. Xu. (1992). “Automated Process Planning for Printed Circuit Card Assembly.” IIE Transactions 24, 18–30.

    Google Scholar 

  • Savelsbergh, M.W.P. and G.L. Nemhauser. (1994). “Functional Description of MINTO, a Mixed INTeger Optimizer, Version 2.0b.” Report COC-91-03 from Computational Optimization Center, Georgia Institute of Technology, Atlanta, Georgia.

    Google Scholar 

  • Zijm, W.H.M. and A. van Harten. (1993). “Process Planning for a Modular Component Placement System.” International Journal of Production Economics 31, 123–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Louisville, Louisville, Kentucky

    Gail W. Depuy

  2. Georgia Institute of Technology, Atlanta, Georgia

    Martin W.P. Savelsbergh, Jane C. Ammons & Leon F. McGinnis

Authors
  1. Gail W. Depuy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin W.P. Savelsbergh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jane C. Ammons
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leon F. McGinnis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Depuy, G.W., Savelsbergh, M.W., Ammons, J.C. et al. An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems. Journal of Heuristics 7, 351–369 (2001). https://doi.org/10.1023/A:1011388227723

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011388227723

Search

Navigation