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

Eureka: A Hybrid System for Assembly Line Balancing

Author

Listed:
  • Thomas R. Hoffmann

    (Carlson School of Management, University of Minnesota, Minneapolis, Minnesota 55455)

Abstract

Numerous methods have been proposed for solution of the simple assembly line balancing (SALB) problem. This paper describes a branch and bound algorithm which in many cases is faster than the well-known Hoffmann heuristic technique to which it is related. It introduces a simple bounding rule which uses the concept of the "theoretical" minimum slack time to achieve rapid solutions. It is combined with the Hoffmann heuristic to develop an even more effective system for solving SALB problems. Timing results are given for a standard set of problems found in the literature. Since that set was solved in such a very short time, more challenging as well as more typical problems are explored and timing results presented. Benchmarking of the procedure is easier since implementation is on an eight-megahertz IBM AT with a math coprocessor, using the standard IBM PC Professional FORTRAN compiler.

Suggested Citation

  • Thomas R. Hoffmann, 1992. "Eureka: A Hybrid System for Assembly Line Balancing," Management Science, INFORMS, vol. 38(1), pages 39-47, January.
  • Handle: RePEc:inm:ormnsc:v:38:y:1992:i:1:p:39-47
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.38.1.39
    Download Restriction: no

    Citations

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


    Cited by:

    1. Hu, Xiaofeng & Wu, Erfei & Jin, Ye, 2008. "A station-oriented enumerative algorithm for two-sided assembly line balancing," European Journal of Operational Research, Elsevier, vol. 186(1), pages 435-440, April.
    2. repec:eee:jomega:v:78:y:2018:i:c:p:57-68 is not listed on IDEAS
    3. 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.
    4. 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.
    5. Vilà, Mariona & Pereira, Jordi, 2013. "An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time," European Journal of Operational Research, Elsevier, vol. 229(1), pages 106-113.
    6. 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.
    7. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    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. Aase, Gerald R. & Olson, John R. & Schniederjans, Marc J., 2004. "U-shaped assembly line layouts and their impact on labor productivity: An experimental study," European Journal of Operational Research, Elsevier, vol. 156(3), pages 698-711, August.
    10. Sabuncuoglu, Ihsan & Erel, Erdal & Alp, Arda, 2009. "Ant colony optimization for the single model U-type assembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 287-300, August.
    11. 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.
    12. 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.
    13. Kimms, Alf, 2000. "Balancing u-shaped assembly lines heuristically," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 524, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. 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.
    15. Kimms, Alf, 1998. "Minimal investment budgets for flow line configuration," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 470, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Otto, Alena & Otto, Christian & Scholl, Armin, 2013. "Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 228(1), pages 33-45.
    17. 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.
    18. Morrison, David R. & Sewell, Edward C. & Jacobson, Sheldon H., 2014. "An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset," European Journal of Operational Research, Elsevier, vol. 236(2), pages 403-409.
    19. 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.
    20. Sprecher, Arno, 1997. "A competitive exact algorithm for assembly line balancing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 449, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:38:y:1992:i:1:p:39-47. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.