Advanced Search
MyIDEAS: Login to save this article or follow this journal

Assembly Line Balancing with Processing Alternatives: An Application

Contents:

Author Info

  • Peter A. Pinto

    (Bowling Green State University)

  • David G. Dannenbring

    (Columbia University)

  • Basheer M. Khumawala

    (University of Houston)

Registered author(s):

    Abstract

    The conventional approach to the assembly line balancing problem assumes that the manufacturing methods to be used have been predetermined. However, in practice the design engineer has several alternatives available in the choice of processing, typically involving a trade-off between labor or capital intensive options. The choice of manufacturing method is frequently viewed as an investment or capital budgeting decision, contrasting projected savings in labor cost with the additional fixed cost for the more capital intensive alternatives. The manufacturing tasks (based on the selected processing alternatives) are then assigned to work stations so as to minimize the number of work stations (i.e., labor costs) necessary to achieve a desired production rate. This paper describes a method of simultaneously considering both the choice of manufacturing alternatives and the assignment of tasks to stations so as to minimize total costs (labor and fixed) over the expected life of the production line. The importance of considering these decisions jointly results from the fact that the benefits obtained from specific manufacturing alternatives should not be limited to anticipated labor savings alone. The true measure of achievable labor savings can only be determined after an assignment of tasks to stations has been chosen. For instance, although a processing alternative may reduce the total work content of a set of tasks, if the resulting line balancing assignment does not reduce the number of stations required to achieve a desired production rate, the assumed savings will not be achievable and will serve only to increase the idle time of the line. On the other hand, an apparently trivial reduction in the time to complete a certain task may lead to a more efficiently balanced line, producing a much greater real savings in labor cost than had been anticipated, due to a reduction in both work content and idle time for the line. The combined processing alternative line balancing problem can be formulated as an integer programming problem. Two alternate formulations are provided which differ in the degree of flexibility in selecting a cycle time. A branch and bound procedure is described for the fixed cycle time situation which takes advantage of the special structure of the problem to provide an efficient method capable of solving problems of practical interest. The effectiveness of the proposed procedure is demonstrated by application to an actual redesign of an assembly line for a major auto-industry supplier.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.29.7.817
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 29 (1983)
    Issue (Month): 7 (July)
    Pages: 817-830

    as in new window
    Handle: RePEc:inm:ormnsc:v:29:y:1983:i:7:p:817-830

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: production/scheduling: line balancing; finance: capital budgeting; programming: integer algorithms; branch and bound;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Hsiu-Hsueh Kao & Din-Horng Yeh & Yi-Hsien Wang, 2011. "Resource Constrained Assembly Line Balancing Problem Solved with Ranked Positional Weight Rule," Review of Economics & Finance, Better Advances Press, Canada, vol. 1, pages 71-80, November.
    2. Jayaswal, Sachin & Agarwal, Prashant, . "Balancing U-Shaped Assembly Lines with Resource Dependent Task Times: A Simulated Annealing Approach," IIMA Working Papers WP2013-11-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Pinnoi, Anulark & Wilhelm, Wilbert E., 2000. "Valid inequalities for a class of assembly system problems," European Journal of Operational Research, Elsevier, vol. 126(1), pages 31-50, October.
    4. Nils Boysen & Malte Fliedner & Armin Scholl, 2006. "Assembly line balancing: Which model to use when?," Jenaer Schriften zur Wirtschaftswissenschaft 23/2006, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
    5. Nils Boysen & Malte Fliedner & Armin Scholl, 2006. "Produktionsplanung bei Variantenfließfertigung: Planungshierarchie und Hierarchische Planung," Jenaer Schriften zur Wirtschaftswissenschaft 22/2006, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
    6. Armin Scholl & Nils Boysen & Malte Fliedner, 2008. "Optimally solving the Alternative Subgraphs Assembly Line Balancing Problem," Jena Research Papers in Business and Economics - Working and Discussion Papers 05/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
    7. Gamberi, M. & Gamberini, R. & Manzini, R. & Regattieri, A., 2008. "An analytical model to evaluating the implementation of a batch-production-oriented line," International Journal of Production Economics, Elsevier, vol. 111(2), pages 729-740, February.
    8. Araújo, Felipe F.B. & Costa, Alysson M. & Miralles, Cristóbal, 2012. "Two extensions for the ALWABP: Parallel stations and collaborative approach," International Journal of Production Economics, Elsevier, vol. 140(1), pages 483-495.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:29:y:1983:i:7:p:817-830. 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).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.