Annals of Operations Research

, 172:243

Optimally solving the alternative subgraphs assembly line balancing problem

Article

Abstract

Assembly line balancing problems (ALBP) consist of distributing the total workload for manufacturing any unit of the products to be assembled among the work stations along a manufacturing line as used in the automotive or the electronics industries. Usually, it is assumed that the production process is fixed, i.e., has been determined in a preceding planning step. However, this sequential planning approach is often suboptimal because the efficiency of the production process can not be evaluated definitely without knowing the distribution of work. Instead, both decisions should be taken simultaneously. This has led to the Alternative Subgraphs ALBP.

We give an alternative representation of the problem, formulate an improved mixed-integer program and propose a solution approach based on SALOME, an effective branch-and-bound procedure for the well-known Simple ALBP. Computational experiments indicate that the proposed procedure is successful in finding optimal solutions for small- and medium-sized problem instances and rather good heuristic solutions for large-scaled instances.

Keywords

Assembly line balancing Production process Mass-production Combinatorial optimization Sequencing 

References

  1. Baybars, I. (1986). A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32, 909–932. CrossRefGoogle Scholar
  2. Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168, 694–715. CrossRefGoogle Scholar
  3. Bowman, E. (1960). Assembly-line balancing by linear programming. Operations Research, 8, 385–389. CrossRefGoogle Scholar
  4. Boysen, N., Fliedner, M., & Scholl, A. (2007). A classification of assembly line balancing problems. European Journal of Operational Research, 183, 674–693. CrossRefGoogle Scholar
  5. Bukchin, J., & Tzur, M. (2000). Design of flexible assembly line to minimize equipment cost. IIE Transactions, 32, 585–598. Google Scholar
  6. Capacho, L., & Pastor, R. (2005). ASALBP: The alternative subgraphs assembly line balancing problem. Working paper IOC-DT-P 2005-5, Universitat Politècnica de Catalunya. Google Scholar
  7. Capacho, L., & Pastor, R. (2006). The ASALB problem with processing alternatives involving different tasks: Definition, formalization and resolution. Lecture Notes in Computer Science, 3982, 554–563. CrossRefGoogle Scholar
  8. Capacho, L., & Pastor, R. (2008). ASALBP: The alternative subgraphs assembly line balancing problem. International Journal of Production Research, 46, 3503–3516. CrossRefGoogle Scholar
  9. Capacho, L., Pastor, R., Guschinskaya, O., & Dolgui, A. (2006). Heuristic methods to solve the alternative subgraphs assembly line balancing problem. In IEEE international conference on automation science and engineering, 2006 (CASE’06), Shanghai, China, pp. 501–506. Google Scholar
  10. Capacho, L., Pastor, R., Dolgui, A., & Gunshinskaya, O. (2009). An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem. Journal of Heuristics, 15, 109–132. CrossRefGoogle Scholar
  11. Erel, E., & Sarin, S. C. (1998). A survey of the assembly line balancing procedures. Production Planning & Control, 9, 414–434. CrossRefGoogle Scholar
  12. Patterson, J. H., & Albracht, J. J. (1975). Assembly-line balancing: zero-one programming with Fibonacci search. Operations Research, 23, 166–172. CrossRefGoogle Scholar
  13. Pinto, P. A., Dannenbring, D. G., & Khumawala, B. M. (1983). Assembly line balancing with processing alternatives: An application. Management Science, 29, 817–830. CrossRefGoogle Scholar
  14. Rekiek, B., Dolgui, A., Delchambre, A., & Bratcu, A. (2002). State of art of optimization methods for assembly line. Annual Reviews in Control, 26, 163–174. CrossRefGoogle Scholar
  15. Saltzman, M. J., & Baybars, I. (1987). A two-process implicit enumeration algorithm for the simple assembly line balancing problem. European Journal of Operational Research, 32, 118–129. CrossRefGoogle Scholar
  16. Scholl, A. (1999). Balancing and sequencing of assembly lines (2nd edn). Heidelberg: Physica. Google Scholar
  17. Scholl, A., & Becker, C. (2006). State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, 168, 666–693. CrossRefGoogle Scholar
  18. Scholl, A., & Klein, R. (1997). SALOME: A bidirectional branch and bound procedure for assembly line balancing. INFORMS Journal on Computing, 9, 319–334. CrossRefGoogle Scholar
  19. Scholl, A., & Klein, R. (1999). Balancing assembly lines effectively—a computational comparison. European Journal of Operational Research, 114, 50–58. CrossRefGoogle Scholar
  20. Scholl, A., Boysen, N., & Fliedner, M. (2008). The sequence-dependent assembly line balancing problem. Operations Research Spectrum, 30, 579–609. Google Scholar
  21. Sprecher, A. (1999). A competitive branch-and-bound algorithm for the simple assembly line balancing problem. International Journal of Production Research, 37, 1787–1816. CrossRefGoogle Scholar
  22. Thangavelu, S. R., & Shetty, C. M. (1971). Assembly line balancing by 0-1 integer programming. AIIE Transactions, 3, 61–68. Google Scholar
  23. White, W. W. (1961). Comments on a paper by Bowman. Operations Research, 9, 274–276. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Chair of Management Science & Decision AnalysisFriedrich-Schiller-University of JenaJenaGermany
  2. 2.Chair of Operations ManagementFriedrich-Schiller-University of JenaJenaGermany

Personalised recommendations