IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v41y1994i5p587-608.html
   My bibliography  Save this article

Printed circuit board family grouping and component allocation for a multimachine, open‐shop assembly cell

Author

Listed:
  • Ronald G. Askin
  • Moshe Dror
  • Asoo J. Vakharia

Abstract

This article considers a particular printed circuit board (PCB) assembly system employing surface mount technology. Multiple, identical automatic placement machines, a variety of board types, and a large number of component types characterize the environment studied. The problem addressed is that of minimizing the makespan for assembling a batch of boards with a secondary objective of reducing the mean flow time. The approach adopted is that of grouping boards into production families, allocating component types to placement machines for each family, dividing of families into board groups with similar processing times, and the scheduling of groups. A complete setup is incurred only when changing over between board families. For the environment studied, precedence constraints on the order of component placement do not exist, and placement times are independent of feeder location. Heuristic solution procedures are proposed to create board subfamilies (groups) for which the component mounting times are nearly identical within a subfamily. Assignment of the same component type to multiple machines is avoided. The procedures use results from the theory of open‐shop scheduling and parallel processor scheduling to sequence boards on machines. Note that we do not impose an open‐shop environment but rather model the problem in the context of an open shop, because the order of component mountings is immaterial. Three procedures are proposed for allocating components to machines and subsequently scheduling boards on the machines. The first two procedures assign components to machines to balance total work load. For scheduling purposes, the first method groups boards into subfamilies to adhere to the assumptions of the open‐shop model, and the second procedure assumes that each board is a subfamily and these are scheduled in order of shortest total processing time. The third procedure starts by forming board subfamilies based on total component similarity and then assigns components to validate the open‐shop model. We compare the performance of the three procedures using estimated daily, two‐day, and weekly production requirements by averaging quarterly production data for an actual cell consisting of five decoupled machines. © 1994 John Wiley & Sons, Inc.

Suggested Citation

  • Ronald G. Askin & Moshe Dror & Asoo J. Vakharia, 1994. "Printed circuit board family grouping and component allocation for a multimachine, open‐shop assembly cell," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(5), pages 587-608, August.
    • Handle: RePEc:wly:navres:v:41:y:1994:i:5:p:587-608
    DOI: 10.1002/1520-6750(199408)41:53.0.CO;2-Q
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199408)41:53.0.CO;2-Q
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199408)41:53.0.CO;2-Q?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Christopher S. Tang & Eric V. Denardo, 1988. "Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches," Operations Research, INFORMS, vol. 36(5), pages 767-777, October.
    2. Javad Ahmadi & Stephen Grotzinger & Dennis Johnson, 1988. "Component Allocation and Partitioning for a Dual Delivery Placement Machine," Operations Research, INFORMS, vol. 36(2), pages 176-191, April.
    3. I. Adiri & N. Aizikowitz (Hefetz), 1989. "Open‐shop scheduling problems with dominated machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(3), pages 273-281, June.
    4. Leipala, Timo & Nevalainen, Olli, 1989. "Optimization of the movements of a component placement machine," European Journal of Operational Research, Elsevier, vol. 38(2), pages 167-177, January.
    5. Christopher B. Lofgren & Leon F. McGinnis & Craig A. Tovey, 1991. "Routing Printed Circuit Cards Through an Assembly Cell," Operations Research, INFORMS, vol. 39(6), pages 992-1004, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Crama, Yves & Flippo, Olaf E. & van de Klundert, Joris & Spieksma, Frits C. R., 1997. "The assembly of printed circuit boards: A case with multiple machines and multiple board types," European Journal of Operational Research, Elsevier, vol. 98(3), pages 457-472, May.
    2. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    3. Ahmadi, Reza H. & Kouvelis, Panagiotis, 1999. "Design of electronic assembly lines: An analytical framework and its application," European Journal of Operational Research, Elsevier, vol. 115(1), pages 113-137, May.
    4. Klomp, Cornelis & van de Klundert, Joris & Spieksma, Frits C. R. & Voogt, Siem, 2000. "The feeder rack assignment problem in PCB assembly: A case study," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 399-407, March.
    5. Anantaram Balakrishnan & François Vanderbeck, 1999. "A Tactical Planning Model for Mixed-Model Electronics Assembly Operations," Operations Research, INFORMS, vol. 47(3), pages 395-409, June.
    6. Choudhury, Nilanjan D. & Wilhelm, Wilbert E. & Rao, Brijesh & Gott, Jonathan & Khotekar, Nikhilesh, 2007. "Process planning for circuit card assembly on a series of dual head placement machines," European Journal of Operational Research, Elsevier, vol. 182(2), pages 626-639, October.
    7. Van Hop, Nguyen & Nagarur, Nagendra N., 2004. "The scheduling problem of PCBs for multiple non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 158(3), pages 577-594, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Crama, Yves & Flippo, Olaf E. & van de Klundert, Joris & Spieksma, Frits C. R., 1997. "The assembly of printed circuit boards: A case with multiple machines and multiple board types," European Journal of Operational Research, Elsevier, vol. 98(3), pages 457-472, May.
    2. Altinkemer, Kemal & Kazaz, Burak & Koksalan, Murat & Moskowitz, Herbert, 2000. "Optimization of printed circuit board manufacturing: Integrated modeling and algorithms," European Journal of Operational Research, Elsevier, vol. 124(2), pages 409-421, July.
    3. Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
    4. Klomp, Cornelis & van de Klundert, Joris & Spieksma, Frits C. R. & Voogt, Siem, 2000. "The feeder rack assignment problem in PCB assembly: A case study," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 399-407, March.
    5. Ayob, Masri & Kendall, Graham, 2008. "A survey of surface mount device placement machine optimisation: Machine classification," European Journal of Operational Research, Elsevier, vol. 186(3), pages 893-914, May.
    6. Yves Crama & Joris van de Klundert, 1999. "Worst‐case performance of approximation algorithms for tool management problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 445-462, August.
    7. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    8. George Polak, 2005. "On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices," Annals of Operations Research, Springer, vol. 138(1), pages 223-233, September.
    9. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    10. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    11. E Duman, 2007. "Modelling the operations of a component placement machine with rotational turret and stationary component magazine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 317-325, March.
    12. Spieksma, F.C.R. & Crama, Y. & van de Klundert, J. & Flippo, O.E., 1995. "The component retrieval problem in printed circuit board assembly," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    13. Chakravarty, Amiya K. & Balakrishnan, Nagraj, 1997. "Job sequencing rules for minimizing the expected makespan in flexible machines," European Journal of Operational Research, Elsevier, vol. 96(2), pages 274-288, January.
    14. Matzliach, Barouch & Tzur, Michal, 2000. "Storage management of items in two levels of availability," European Journal of Operational Research, Elsevier, vol. 121(2), pages 363-379, March.
    15. Ciavotta, Michele & Detti, Paolo & Meloni, Carlo & Pranzo, Marco, 2008. "A bi-objective coordination setup problem in a two-stage production system," European Journal of Operational Research, Elsevier, vol. 189(3), pages 734-745, September.
    16. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    17. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    18. Ahmadi, Reza H. & Kouvelis, Panagiotis, 1999. "Design of electronic assembly lines: An analytical framework and its application," European Journal of Operational Research, Elsevier, vol. 115(1), pages 113-137, May.
    19. Liao, Ching-Jong & Shyu, Cian-Ci & Tseng, Chao-Tang, 2009. "A least flexibility first heuristic to coordinate setups in a two- or three-stage supply chain," International Journal of Production Economics, Elsevier, vol. 117(1), pages 127-135, January.
    20. Moshe Dror & Mohamed Haouari, 2000. "Generalized Steiner Problems and Other Variants," Journal of Combinatorial Optimization, Springer, vol. 4(4), pages 415-436, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:41:y:1994:i:5:p:587-608. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.