IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v44y1998i1p103-118.html
   My bibliography  Save this article

Assembly System Design: A Branch and Cut Approach

Author

Listed:
  • Anulark Pinnoi

    (Industrial Systems Engineering, Asian Institute of Technology, Patumtani 12120, Thailand)

  • Wilbert E. Wilhelm

    (Department of Industrial Engineering, Texas A&M University, College Station, Texas 77843-3131)

Abstract

This paper addresses the single-product assembly system design problem (ASDP), which seeks to minimize total cost by optimally integrating design (selecting the machine type to locate at each activated station) and operating issues (assigning tasks to observe precedence relationships and cycle time restrictions). We propose an effective branch-and-cut approach for solving single-product ASDPs, adapting inequalities known to be valid for embedded line balancing structures to form inequalities that are valid for the ASDP. The implementation also involves a specialized preprocessor, a heuristic, separation procedures, and an enumeration scheme. Computational tests establish benchmark results for this first implementation of cutting planes for solving the ASDP.

Suggested Citation

  • Anulark Pinnoi & Wilbert E. Wilhelm, 1998. "Assembly System Design: A Branch and Cut Approach," Management Science, INFORMS, vol. 44(1), pages 103-118, January.
    • Handle: RePEc:inm:ormnsc:v:44:y:1998:i:1:p:103-118
    DOI: 10.1287/mnsc.44.1.103
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.44.1.103
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.44.1.103?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. Stephen C. Graves & Bruce W. Lamar, 1983. "An Integer Programming Procedure for Assembly System Design Problems," Operations Research, INFORMS, vol. 31(3), pages 522-545, June.
    2. Steven T. Hackman & Michael J. Magazine & T. S. Wee, 1989. "Fast, Effective Algorithms for Simple Assembly Line Balancing Problems," Operations Research, INFORMS, vol. 37(6), pages 916-924, December.
    3. Peter A. Pinto & David G. Dannenbring & Basheer M. Khumawala, 1983. "Assembly Line Balancing with Processing Alternatives: An Application," Management Science, INFORMS, vol. 29(7), pages 817-830, July.
    4. .Ilker Baybars, 1986. "A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem," Management Science, INFORMS, vol. 32(8), pages 909-932, August.
    5. M. W. Padberg & T. J. Van Roy & L. A. Wolsey, 1985. "Valid Linear Inequalities for Fixed Charge Problems," Operations Research, INFORMS, vol. 33(4), pages 842-861, August.
    6. Padberg, M.W. & Van Roy, T.J. & Wolsey, L.A., 1985. "Valid linear inequalities for fixed charge problems," LIDAM Reprints CORE 656, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. F. Brian Talbot & James H. Patterson & William V. Gehrlein, 1986. "A Comparative Evaluation of Heuristic Line Balancing Techniques," Management Science, INFORMS, vol. 32(4), pages 430-454, April.
    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. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2007. "A classification of assembly line balancing problems," European Journal of Operational Research, Elsevier, vol. 183(2), pages 674-693, December.
    2. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    3. Pinnoi, Anulark & Wilhelm, Wilbert E., 2000. "Valid inequalities for a class of assembly system problems," European Journal of Operational Research, Elsevier, vol. 126(1), pages 31-50, October.
    4. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    5. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    6. Sprecher, Arno, 2000. "SALBLIB: Challenging instances for assembly line balancing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 526, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Corominas, Albert & Pastor, Rafael & Plans, Joan, 2008. "Balancing assembly line with skilled and unskilled workers," Omega, Elsevier, vol. 36(6), pages 1126-1132, December.
    8. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    9. Gamberi, M. & Gamberini, R. & Manzini, R. & Regattieri, A., 2008. "An analytical model to evaluating the implementation of a batch-production-oriented line," International Journal of Production Economics, Elsevier, vol. 111(2), pages 729-740, February.
    10. Miralles, Cristobal & Garcia-Sabater, Jose Pedro & Andres, Carlos & Cardos, Manuel, 2007. "Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study," International Journal of Production Economics, Elsevier, vol. 110(1-2), pages 187-197, October.
    11. Araújo, Felipe F.B. & Costa, Alysson M. & Miralles, Cristóbal, 2012. "Two extensions for the ALWABP: Parallel stations and collaborative approach," International Journal of Production Economics, Elsevier, vol. 140(1), pages 483-495.
    12. Gicquel, C. & Miégeville, N. & Minoux, M. & Dallery, Y., 2010. "Optimizing glass coating lines: MIP model and valid inequalities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 747-755, May.
    13. Wilbert E. Wilhelm & Radu Gadidov, 2004. "A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 39-55, February.

    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. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    2. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    3. Scholl, Armin & Klein, Robert, 1999. "Balancing assembly lines effectively - A computational comparison," European Journal of Operational Research, Elsevier, vol. 114(1), pages 50-58, April.
    4. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    5. Franco Guerriero & John Miltenburg, 2003. "The stochastic U‐line balancing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 31-57, February.
    6. Bautista, Joaquin & Pereira, Jordi, 2007. "Ant algorithms for a time and space constrained assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2016-2032, March.
    7. Fleszar, Krzysztof & Hindi, Khalil S., 2003. "An enumerative heuristic and reduction methods for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 606-620, March.
    8. Fatih Ugurdag, H. & Rachamadugu, Ram & Papachristou, Christos A., 1997. "Designing paced assembly lines with fixed number of stations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 488-501, November.
    9. Peeters, Marc & Degraeve, Zeger, 2006. "An linear programming based lower bound for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 716-731, February.
    10. Miltenburg, John, 1998. "Balancing U-lines in a multiple U-line facility," European Journal of Operational Research, Elsevier, vol. 109(1), pages 1-23, August.
    11. Wilbert E. Wilhelm & Radu Gadidov, 2004. "A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 39-55, February.
    12. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    13. Pinnoi, Anulark & Wilhelm, Wilbert E., 2000. "Valid inequalities for a class of assembly system problems," European Journal of Operational Research, Elsevier, vol. 126(1), pages 31-50, October.
    14. Klein, Robert & Scholl, Armin, 1996. "Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure," European Journal of Operational Research, Elsevier, vol. 91(2), pages 367-385, June.
    15. Agostinho Agra & Marielle Christiansen & Alexandrino Delgado, 2013. "Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem," Transportation Science, INFORMS, vol. 47(1), pages 108-124, February.
    16. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    17. Quentin Louveaux & Laurence Wolsey, 2007. "Lifting, superadditivity, mixed integer rounding and single node flow sets revisited," Annals of Operations Research, Springer, vol. 153(1), pages 47-77, September.
    18. Doostmohammadi, Mahdi & Akartunalı, Kerem, 2018. "Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case," European Journal of Operational Research, Elsevier, vol. 267(1), pages 86-95.
    19. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    20. Jonathan Oesterle & Lionel Amodeo & Farouk Yalaoui, 2019. "A comparative study of Multi-Objective Algorithms for the Assembly Line Balancing and Equipment Selection Problem under consideration of Product Design Alternatives," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1021-1046, March.

    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:inm:ormnsc:v:44:y:1998:i:1:p:103-118. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.