IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this paper

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

No abstract is available for this item.

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.1016/j.ejor.2004.07.022
Download Restriction: no

Paper provided by Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät in its series Jenaer Schriften zur Wirtschaftswissenschaft with number 20/2003.

as
in new window

Length:
Date of creation: Oct 2003
Date of revision:
Publication status: Published in: European Journal of Operational Research 168/3, 666-693
Handle: RePEc:jen:jenasw:2003-20
Contact details of provider: Postal:
Carl-Zeiss-Strasse 3, 07743 JENA

Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.wiwiss.uni-jena.de/index.html

More information through EDIRC

Order Information: Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as in new window
  1. 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.
  2. Roger V. Johnson, 1988. "Optimally Balancing Large Assembly Lines with "Fable"," Management Science, INFORMS, vol. 34(2), pages 240-253, February.
  3. 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.
  4. Scholl, Armin, 1999. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10881, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  5. Allan L. Gutjahr & George L. Nemhauser, 1964. "An Algorithm for the Line Balancing Problem," Management Science, INFORMS, vol. 11(2), pages 308-315, November.
  6. 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.
  7. 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).
  8. Roger V. Johnson, 1993. "Note: Microcomputer Performance of "FABLE" on Hoffmann's Data Sets," Management Science, INFORMS, vol. 39(10), pages 1190-1192, October.
  9. 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).
  10. 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.
  11. Anulark Pinnoi & Wilbert E. Wilhelm, 1998. "Assembly System Design: A Branch and Cut Approach," Management Science, INFORMS, vol. 44(1), pages 103-118, January.
  12. 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.
  13. 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.
  14. Thomas R. Hoffmann, 1992. "Eureka: A Hybrid System for Assembly Line Balancing," Management Science, INFORMS, vol. 38(1), pages 39-47, January.
  15. 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.
  16. Uwe Cantner & Holger Graf, 2003. "Cooperation and Specialization in German Technology Regions," Jenaer Schriften zur Wirtschaftswissenschaft 04/2003, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
  17. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
  18. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 7(1), pages 3-3, January.
  19. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 9(1), pages 3-3, May.
  20. 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.
  21. 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).
  22. 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).
  23. Thomas R. Hoffmann, 1963. "Assembly Line Balancing with a Precedence Matrix," Management Science, INFORMS, vol. 9(4), pages 551-562, July.
  24. 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.
  25. 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.
  26. Fred M. Tonge, 1960. "Summary of a Heuristic Line Balancing Procedure," Management Science, INFORMS, vol. 7(1), pages 21-42, October.
  27. 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.
  28. repec:spr:compst:v:52:y:2000:i:3:p:467-488 is not listed on IDEAS
  29. 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).
  30. 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.
  31. 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.
  32. Fred M. Tonge, 1965. "Assembly Line Balancing Using Probabilistic Combinations of Heuristics," Management Science, INFORMS, vol. 11(7), pages 727-735, May.
  33. 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.
  34. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 10(1), pages 3-3, July.
  35. 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.
  36. 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).
  37. 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).
  38. 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.
  39. 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.
  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, 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.
  42. 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.
  43. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
  44. N/A, 1960. "Summary," National Institute Economic Review, National Institute of Economic and Social Research, vol. 8(1), pages 3-3, March.
Full references (including those not matched with items on IDEAS)

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

When requesting a correction, please mention this item's handle: RePEc:jen:jenasw:2003-20. 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: ()

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.