IDEAS home Printed from https://ideas.repec.org/p/jen/jenjbe/2008-02.html
   My bibliography  Save this paper

Absalom: Balancing assembly lines with assignment restrictions

Author

Listed:
  • Armin Scholl

    () (School of Economics and Business Administration, Friedrich-Schiller-University Jena)

  • Malte Fliedner
  • Nils Boysen

    () (School of Economics and Business Administration, Friedrich-Schiller-University Jena)

Abstract

Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On the other hand, a number of real-world extensions of SALBP have been introduced but solved with straight-forward and simple heuristics in many cases. Therefore, there is a lack of procedures for exactly solving such generalized ALBP.In this paper, we show how to extend the well-known solution procedure Salome [Scholl, A., Klein, R., 1997. Salome: A bidirectional branch-and-bound procedure for assembly line balancing. Informs J. Comput. 9 319-334], which is able to solve even large SALBP instances in a very effective manner, to a problem extension with different types of assignment restrictions (called ARALBP). The extended procedure, referred to as Absalom, employs a favorable branching scheme, an arsenal of bounding rules and a variety of logical tests using ideas from constraint programming.Computational experiments show that Absalom is a very promising exact solution approach although the additional assignment restrictions complicate the problem considerably and necessitate a relaxation of some components of Salome.

Suggested Citation

  • Armin Scholl & Malte Fliedner & Nils Boysen, 2008. "Absalom: Balancing assembly lines with assignment restrictions," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 02/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
  • Handle: RePEc:jen:jenjbe:2008-02
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1016/j.ejor.2009.01.049
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Klein, Robert, 1999. "Computing lower bounds by destructive improvement - an application to resource-constrained project scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10913, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. E. M. Dar-El & Y. Rubinovitch, 1979. "Must--A Multiple Solutions Technique for Balancing Single Model Assembly Lines," Management Science, INFORMS, vol. 25(11), pages 1105-1114, November.
    4. 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.
    5. Roger V. Johnson, 1988. "Optimally Balancing Large Assembly Lines with "Fable"," Management Science, INFORMS, vol. 34(2), pages 240-253, February.
    6. 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.
    7. Lapierre, Sophie D. & Ruiz, Angel & Soriano, Patrick, 2006. "Balancing assembly lines with tabu search," European Journal of Operational Research, Elsevier, vol. 168(3), pages 826-837, February.
    8. Saltzman, Matthew J. & Baybars, Ilker, 1987. "A two-process implicit enumeration algorithm for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 32(1), pages 118-129, October.
    9. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    10. 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.
    11. Berger, Ilana & Bourjolly, Jean-Marie & Laporte, Gilbert, 1992. "Branch-and-bound algorithms for the multi-product assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 215-222, April.
    12. Roger V. Johnson, 1983. "A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities," Management Science, INFORMS, vol. 29(11), pages 1309-1324, November.
    13. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    14. Armin Scholl & Nils Boysen & Malte Fliedner, 2006. "The sequence-dependent assembly line balancing problem," Jenaer Schriften zur Wirtschaftswissenschaft (Expired!) 18/2006, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Scholl, Armin, 1995. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9690, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    20. Scholl, Armin & Klein, Robert, 1997. "SALOME. a bidirectional branch and bound procedure for assembly line balancing," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7890, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    21. Gokcen, Hadi & Erel, Erdal, 1997. "A goal programming approach to mixed-model assembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 48(2), pages 177-185, January.
    22. 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.
    23. .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.
    24. G. M. Buxey, 1974. "Assembly Line Balancing with Multiple Stations," Management Science, INFORMS, vol. 20(6), pages 1010-1021, February.
    25. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
    26. Sawik, Tadeusz, 2002. "Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line," European Journal of Operational Research, Elsevier, vol. 143(1), pages 115-124, November.
    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. Klindworth, Hanne & Otto, Christian & Scholl, Armin, 2012. "On a learning precedence graph concept for the automotive industry," European Journal of Operational Research, Elsevier, vol. 217(2), pages 259-269.
    2. Sternatz, Johannes, 2015. "The joint line balancing and material supply problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 304-318.
    3. Bautista, Joaquín & Batalla-García, Cristina & Alfaro-Pozo, Rocío, 2016. "Models for assembly line balancing by temporal, spatial and ergonomic risk attributes," European Journal of Operational Research, Elsevier, vol. 251(3), pages 814-829.
    4. Otto, Alena & Scholl, Armin, 2011. "Incorporating ergonomic risks into assembly line balancing," European Journal of Operational Research, Elsevier, vol. 212(2), pages 277-286, July.
    5. Jietao Dong & Linxuan Zhang & Tianyuan Xiao, 0. "A hybrid PSO/SA algorithm for bi-criteria stochastic line balancing with flexible task times and zoning constraints," Journal of Intelligent Manufacturing, Springer, vol. 0, pages 1-15.
    6. Sikora, Celso Gustavo Stall & Lopes, Thiago Cantos & Magatão, Leandro, 2017. "Traveling worker assembly line (re)balancing problem: Model, reduction techniques, and real case studies," European Journal of Operational Research, Elsevier, vol. 259(3), pages 949-971.
    7. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
    8. Atiya Al-Zuheri & Lee Luong & Ke Xing, 2016. "Developing a multi-objective genetic optimisation approach for an operational design of a manual mixed-model assembly line with walking workers," Journal of Intelligent Manufacturing, Springer, vol. 27(5), pages 1049-1065, October.
    9. 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.
    10. Armin Scholl & Nils Boysen, 2008. "The Multiproduct Parallel Assembly Lines Balancing Problem: Model and Optimization Procedure," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 13/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
    11. 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.
    12. Becker, Christian & Scholl, Armin, 2009. "Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure," European Journal of Operational Research, Elsevier, vol. 199(2), pages 359-374, December.
    13. Christian Becker & Armin Scholl, 2008. "Balancing assembly lines with variable parallel workplaces: Problem definition, model and exact solution procedure," Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) 06/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
    14. repec:eee:ejores:v:263:y:2017:i:3:p:1033-1048 is not listed on IDEAS
    15. Scholl, Armin & Boysen, Nils, 2009. "Designing parallel assembly lines with split workplaces: Model and optimization procedure," International Journal of Production Economics, Elsevier, vol. 119(1), pages 90-100, May.
    16. Rasul Esmaeilbeigi & Bahman Naderi & Parisa Charkhgard, 2016. "New formulations for the setup assembly line balancing and scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 493-518, March.

    More about this item

    Keywords

    Assembly line balancing; Assignment restrictions; Combinatorial optimization; Branch-and-bound;

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:jen:jenjbe:2008-02. 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: (). General contact details of provider: http://www.wiwi.uni-jena.de/ .

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

    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.