IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i11p3327-3340.html
   My bibliography  Save this article

Empirical evaluation of lower bounding methods for the simple assembly line balancing problem

Author

Listed:
  • Jordi Pereira

Abstract

The simple assembly line balancing problem (SALBP) is a classical problem that arises in the design of assembly lines. The objective of the SALBP is to divide the assembly work among different workstations of the assembly line in order to maximise the efficiency of the entire line. In this paper, we: (a) put forward different families of lower bounds for the SALBP; (b) introduce new lower bounds; (c) generalise previous results; and (d) analyse the performance of these lower bounding techniques in terms of solution quality using a recently proposed set of instances. An analysis of the results of these bounds leads us to: (1) improve the best-known lower bound for 104 out of the 175 open instances from the benchmark set; (2) identify the areas of applicability of different sources of bounds; and (3) identify possible uses of these bounds in other assembly line balancing problems.

Suggested Citation

  • Jordi Pereira, 2015. "Empirical evaluation of lower bounding methods for the simple assembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 53(11), pages 3327-3340, June.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:11:p:3327-3340
    DOI: 10.1080/00207543.2014.980014
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.980014
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.980014?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Quanming Cheng & Sen Wu & Yang Zhao, 2017. "A bin packing problem of the laundry washing buckets scheduling based on the buffer area," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(3), pages 1981-1988, November.
    2. Diefenbach, Johannes & Stolletz, Raik, 2022. "Stochastic assembly line balancing: General bounds and reliability-based branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 302(2), pages 589-605.
    3. Pereira, Jordi & Álvarez-Miranda, Eduardo, 2018. "An exact approach for the robust assembly line balancing problem," Omega, Elsevier, vol. 78(C), pages 85-98.
    4. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
    5. Pereira, Jordi, 2016. "Procedures for the bin packing problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 250(3), pages 794-806.
    6. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).

    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:taf:tprsxx:v:53:y:2015:i:11:p:3327-3340. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.