IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v253y2017i1d10.1007_s10479-016-2156-x.html
   My bibliography  Save this article

Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method

Author

Listed:
  • Talip Kellegöz

    (Gazi University, Engineering Faculty)

Abstract

This paper addresses an assembly line balancing problem in which each station is allowed to have more than one worker, with minimization of two objectives: (i) the number of workers used in the line and (ii) the number of stations opened in the line. Each station has an own workpiece, and workers at the same station simultaneously perform different assembly tasks on its workpiece. For solving the balancing problem of these lines, a new mixed integer programming formulation is presented, and then a simulated annealing based heuristic method is proposed. The new formulation requires less number of variables and constraints. The basic property of the proposed heuristic is that it is directly applied to Gantt representations of problem’s solutions. Moreover, the paper includes some important neighborhood generation properties for Gantt representations of solutions. Both methods are compared with existing methods available in the literature. Experimental study indicates that the proposed methods can yield promising results.

Suggested Citation

  • Talip Kellegöz, 2017. "Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method," Annals of Operations Research, Springer, vol. 253(1), pages 377-404, June.
  • Handle: RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2156-x
    DOI: 10.1007/s10479-016-2156-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2156-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-016-2156-x?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.

    References listed on IDEAS

    as
    1. Thomas R. Hoffmann, 1963. "Assembly Line Balancing with a Precedence Matrix," Management Science, INFORMS, vol. 9(4), pages 551-562, July.
    2. Armin Scholl & Robert Klein, 1997. "SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 319-334, November.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. Armin Scholl & Nils Boysen & Malte Fliedner, 2009. "Optimally solving the alternative subgraphs assembly line balancing problem," Annals of Operations Research, Springer, vol. 172(1), pages 243-258, November.
    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. 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).
    7. 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.
    8. 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).
    9. Talip Kellegöz & Bilal Toklu, 2015. "A priority rule-based constructive heuristic and an improvement method for balancing assembly lines with parallel multi-manned workstations," International Journal of Production Research, Taylor & Francis Journals, vol. 53(3), pages 736-756, February.
    10. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    11. Abolfazl Kazemi & Abdolhossein Sedighi, 2013. "A cost-oriented model for balancing mixed-model assembly lines with multi-manned workstations," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 16(3), pages 289-309.
    12. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    Full references (including those not matched with items on IDEAS)

    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. Lopes, Thiago Cantos & Pastre, Giuliano Vidal & Michels, Adalberto Sato & Magatão, Leandro, 2020. "Flexible multi-manned assembly line balancing problem: Model, heuristic procedure, and lower bounds for line length minimization," Omega, Elsevier, vol. 95(C).
    2. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    3. 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.
    4. Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    5. 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.
    6. Michels, Adalberto Sato & Lopes, Thiago Cantos & Sikora, Celso Gustavo Stall & Magatão, Leandro, 2019. "A Benders’ decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 278(3), pages 796-808.
    7. 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.
    8. Sternatz, Johannes, 2015. "The joint line balancing and material supply problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 304-318.
    9. 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.
    10. 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.
    11. 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.
    12. Servranckx, Tom & Vanhoucke, Mario, 2019. "A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs," European Journal of Operational Research, Elsevier, vol. 273(3), pages 841-860.
    13. 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.
    14. Schulze, Philipp & Scholl, Armin & Walter, Rico, 2024. "R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines," European Journal of Operational Research, Elsevier, vol. 312(1), pages 38-55.
    15. Bautista, Joaquín & Pereira, Jordi, 2009. "A dynamic programming based heuristic for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 787-794, May.
    16. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    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. Pape, Tom, 2015. "Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements," European Journal of Operational Research, Elsevier, vol. 240(1), pages 32-42.
    19. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    20. 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.

    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:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2156-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.