IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v197y2009i3p1119-1132.html
   My bibliography  Save this article

Branch and bound algorithm for a transfer line design problem: Stations with sequentially activated multi-spindle heads

Author

Listed:
  • Dolgui, A.
  • Ihnatsenka, I.

Abstract

In this paper, a new transfer line balancing problem is considered. The main difference from the simple assembly line balancing problem is that the operations are grouped into blocks (batches). All the operations of the same block are carried out simultaneously by one piece of equipment (multi-spindle head). Nevertheless, the blocks assigned to the same workstation are executed in series. The line cost consists of the sum of block and workstation costs. At the considered line design stage, the set of all available blocks is given. The aim is to find a subset from the given set of available blocks and to find a partition of this subset to workstations such that each operation is executed once and the line cost is minimal while all the precedence, cycle time, and compatibility (operation inclusion and block exclusion) constraints are respected. A new lower bound based on solving a special set partitioning problem is presented and a branch and bound algorithm is developed. The experimental results prove the quality of the lower bound and applicability of the suggested branch and bound algorithm for medium sized industrial cases.

Suggested Citation

  • Dolgui, A. & Ihnatsenka, I., 2009. "Branch and bound algorithm for a transfer line design problem: Stations with sequentially activated multi-spindle heads," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1119-1132, September.
    • Handle: RePEc:eee:ejores:v:197:y:2009:i:3:p:1119-1132
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00304-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. John F. Pierce & Jeffrey S. Lasky, 1973. "Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems," Management Science, INFORMS, vol. 19(5), pages 528-543, January.
    2. R. S. Garfinkel & G. L. Nemhauser, 1969. "The Set-Partitioning Problem: Set Covering with Equality Constraints," Operations Research, INFORMS, vol. 17(5), pages 848-856, October.
    3. Amen, Matthias, 2000. "Heuristic methods for cost-oriented assembly line balancing: A survey," International Journal of Production Economics, Elsevier, vol. 68(1), pages 1-14, October.
    4. 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).
    5. Amen, Matthias, 2001. "Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time," International Journal of Production Economics, Elsevier, vol. 69(3), pages 255-264, February.
    6. .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.
    7. Dolgui, Alexandre & Guschinsky, Nikolai & Levin, Genrikh, 2006. "A special case of transfer lines balancing by graph approach," European Journal of Operational Research, Elsevier, vol. 168(3), pages 732-746, February.
    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. Delorme, Xavier & Dolgui, Alexandre & Kovalyov, Mikhail Y., 2012. "Combinatorial design of a minimum cost transfer line," Omega, Elsevier, vol. 40(1), pages 31-41, January.
    2. 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.

    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 & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    2. 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.
    3. Scholl, Armin & Becker, Christian, 2005. "A note on "An exact method for cost-oriented assembly line balancing"," International Journal of Production Economics, Elsevier, vol. 97(3), pages 343-352, September.
    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. 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.
    6. Amen, Matthias, 2006. "Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds," European Journal of Operational Research, Elsevier, vol. 168(3), pages 747-770, February.
    7. Gamberini, Rita & Grassi, Andrea & Rimini, Bianca, 2006. "A new multi-objective heuristic algorithm for solving the stochastic assembly line re-balancing problem," International Journal of Production Economics, Elsevier, vol. 102(2), pages 226-243, August.
    8. 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.
    9. 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.
    10. Amen, Matthias, 2000. "Heuristic methods for cost-oriented assembly line balancing: A survey," International Journal of Production Economics, Elsevier, vol. 68(1), pages 1-14, October.
    11. 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.
    12. Hop, Nguyen Van, 2006. "A heuristic solution for fuzzy mixed-model line balancing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 798-810, February.
    13. Guschinskaya, Olga & Dolgui, Alexandre, 2009. "Comparison of exact and heuristic methods for a transfer line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 276-286, August.
    14. 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.
    15. 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.
    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. Karabati, Selcuk & Sayin, Serpil, 2003. "Assembly line balancing in a mixed-model sequencing environment with synchronous transfers," European Journal of Operational Research, Elsevier, vol. 149(2), pages 417-429, September.
    18. Dashuang Li & Chaoyong Zhang & Xinyu Shao & Wenwen Lin, 2016. "A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints," Journal of Intelligent Manufacturing, Springer, vol. 27(4), pages 725-739, August.
    19. 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.
    20. Hager Triki & Ahmed Mellouli & Faouzi Masmoudi, 2017. "A multi-objective genetic algorithm for assembly line resource assignment and balancing problem of type 2 (ALRABP-2)," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 371-385, 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:eee:ejores:v:197:y:2009:i:3:p:1119-1132. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.