IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/470.html
   My bibliography  Save this paper

Minimal investment budgets for flow line configuration

Author

Listed:
  • Kimms, Alf

Abstract

A flow line consists of a sequence of work places (or stations) through which one or more producta (or models) move one-way in order to be processed. Each model requires specific Operations which must be performed in a predefined Order. To be able to do so, the stations must be equipped with machines, robots, and workers having a certain skill such that it is guaranteed that each model passing through the system can be completely processed. The number of stations and the equipment of these stations is called the configuration of the flow line. In this paper we deal with the NP-hard problem of finding a configuration such that the net present value of cash outflows for installing and maintaining the flow line is minimized. As a special case, minimizing the number of stations is treated as well. Lower bounds are derived using column generation. Also, two heuristics are presented. One heuristic is based on the result of the column generation procedura while the other is adapted from the so-called majority merge heuristic. A computational study proves that the feasible Solution obtained on the basis of column generation requires a decidedly lower investment budget.

Suggested Citation

  • 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.
    • Handle: RePEc:zbw:cauman:470
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/149068/1/manuskript_470.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Allan L. Gutjahr & George L. Nemhauser, 1964. "An Algorithm for the Line Balancing Problem," Management Science, INFORMS, vol. 11(2), pages 308-315, November.
    2. Nick T. Thomopoulos, 1967. "Line Balancing-Sequencing for Mixed-Model Assembly," Management Science, INFORMS, vol. 14(2), pages 59-75, October.
    3. 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).
    4. Roger V. Johnson, 1988. "Optimally Balancing Large Assembly Lines with "Fable"," Management Science, INFORMS, vol. 34(2), pages 240-253, February.
    5. van Zante-de Fokkert, Jannet I. & de Kok, Ton G., 1997. "The mixed and multi model line balancing problem: a comparison," European Journal of Operational Research, Elsevier, vol. 100(3), pages 399-412, August.
    6. Thomas R. Hoffmann, 1992. "Eureka: A Hybrid System for Assembly Line Balancing," Management Science, INFORMS, vol. 38(1), pages 39-47, January.
    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. Wilbert E. Wilhelm & Radu Gadidov, 2004. "A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 39-55, February.

    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. 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.
    2. 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.
    3. Bukchin, Yossi & Rabinowitch, Ithai, 2006. "A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs," European Journal of Operational Research, Elsevier, vol. 174(1), pages 492-508, October.
    4. 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.
    5. 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.
    6. Bukchin, Yossi & Raviv, Tal, 2018. "Constraint programming for solving various assembly line balancing problems," Omega, Elsevier, vol. 78(C), pages 57-68.
    7. 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.
    8. 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.
    9. 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.
    10. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    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. 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.
    13. Franco Guerriero & John Miltenburg, 2003. "The stochastic U‐line balancing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 31-57, February.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Dolgui, A. & Guschinsky, N. & Levin, G. & Proth, J.-M., 2008. "Optimisation of multi-position machines and transfer lines," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1375-1389, March.
    20. 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.

    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:zbw:cauman:470. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.html .

    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.