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

State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

Author

Listed:
  • Scholl, Armin
  • Becker, Christian

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:168:y:2006:i:3:p:666-693
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00479-5
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    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. Thomas R. Hoffmann, 1963. "Assembly Line Balancing with a Precedence Matrix," Management Science, INFORMS, vol. 9(4), pages 551-562, July.
    3. Scholl, Armin & Voß, Stefan, 1994. "Simple assembly line balancing : heuristic approaches," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49132, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. repec:spr:compst:v:52:y:2000:i:3:p:467-488 is not listed on IDEAS
    5. F. Brian Talbot & James H. Patterson, 1984. "An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem," Management Science, INFORMS, vol. 30(1), pages 85-99, January.
    6. Robert Klein & Armin Scholl, 2000. "PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 467-488, December.
    7. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 8(1), pages 3-3, March.
    8. 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.
    9. 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).
    10. 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).
    11. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    12. Wen-Chyuan Chiang, 1998. "The application of a tabu search metaheuristic to the assembly line balancing problem," Annals of Operations Research, Springer, vol. 77(0), pages 209-227, January.
    13. 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.
    14. Anulark Pinnoi & Wilbert E. Wilhelm, 1998. "Assembly System Design: A Branch and Cut Approach," Management Science, INFORMS, vol. 44(1), pages 103-118, January.
    15. 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.
    16. 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.
    17. Fred M. Tonge, 1960. "Summary of a Heuristic Line Balancing Procedure," Management Science, INFORMS, vol. 7(1), pages 21-42, October.
    18. Rubinovitz, J. & Levitin, G., 1995. "Genetic algorithm for assembly line balancing," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 343-354, October.
    19. Roger V. Johnson, 1993. "Note: Microcomputer Performance of "FABLE" on Hoffmann's Data Sets," Management Science, INFORMS, vol. 39(10), pages 1190-1192, October.
    20. 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.
    21. Thomas R. Hoffmann, 1992. "Eureka: A Hybrid System for Assembly Line Balancing," Management Science, INFORMS, vol. 38(1), pages 39-47, 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. William V. Gehrlein & James H. Patterson, 1975. "Sequencing for Assembly Lines with Integer Task Times," Management Science, INFORMS, vol. 21(9), pages 1064-1070, May.
    24. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
    25. Betts, J. & Mahmoud, K. I., 1989. "A method for assembly line balancing," Engineering Costs and Production Economics, Elsevier, vol. 18(1), pages 55-64, October.
    26. 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.
    27. 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).
    28. Scholl, Armin & Klein, Robert & Jürgens, Christian, 1996. "BISON : a fast hybrid procedure for exactly solving the one-dimensional bin packing problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49135, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    29. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 10(1), pages 3-3, July.
    30. Scholl, Armin & Voß, Stefan, 1994. "Kapazitätsorientierte Leistungsabstimmung in der Fließfertigung," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49133, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    31. Francis J. Nourie & Enrique R. Venta, 1996. "Note: Microcomputer Performance of OptPack on Hoffmann's Data Sets: Comparison with Eureka and FABLE," Management Science, INFORMS, vol. 42(2), pages 304-306, February.
    32. Uwe Cantner & Holger Graf, 2004. "Cooperation and specialization in German technology regions," Journal of Evolutionary Economics, Springer, vol. 14(5), pages 543-562, December.
    33. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 7(1), pages 3-3, January.
    34. 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.
    35. Roger V. Johnson, 1988. "Optimally Balancing Large Assembly Lines with "Fable"," Management Science, INFORMS, vol. 34(2), pages 240-253, February.
    36. Thomas R. Hoffmann, 1993. "Response to Note on Microcomputer Performance of "FABLE" on Hoffmann's Data Sets," Management Science, INFORMS, vol. 39(10), pages 1192-1193, October.
    37. F. Brian Talbot & James H. Patterson & William V. Gehrlein, 1986. "A Comparative Evaluation of Heuristic Line Balancing Techniques," Management Science, INFORMS, vol. 32(4), pages 430-454, April.
    38. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 9(1), pages 3-3, May.
    39. Fred M. Tonge, 1965. "Assembly Line Balancing Using Probabilistic Combinations of Heuristics," Management Science, INFORMS, vol. 11(7), pages 727-735, May.
    40. Scholl, Armin, 1995. "Data of assembly line balancing problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 25075, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    41. Klein, Robert & Scholl, Armin, 1998. "PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 14077, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    42. Van Assche, F. & Herroelen, W. S., 1979. "An optimal procedure for the single-model deterministic assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 3(2), pages 142-149, March.
    43. Domschke, Wolfgang & Scholl, Armin & Voß, S., 1994. "Verfahren zur Abstimmung von Einprodukt-Fließbändern," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36427, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    44. Fatih Ugurdag, H. & Rachamadugu, Ram & Papachristou, Christos A., 1997. "Designing paced assembly lines with fixed number of stations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 488-501, November.
    Full references (including those not matched with items on IDEAS)

    More about this item

    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:eee:ejores:v:168:y:2006:i:3:p:666-693. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.