Skip to main content
Log in

Simple assembly line balancing—Heuristic approaches

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper heuristics for Type 1 and Type 2 of the Simple Assembly Line Balancing Problem (SALBP) are described. Type 1 of SALBP (SALBP-1) consists of assigning tasks to work stations such that the number of stations is minimized for a given production rate whereas Type 2 (SALBP-2) is to maximize the production rate, or equivalently, to minimize the sum of idle times for a given number of stations. In both problem types, precedence constraints between the tasks have to be considered.

We describe bidirectional and dynamic extensions to heuristic priority rules widely used for SALBP-1. For the solution of SALBP-2 we present search methods which involve the repetitive application of procedures for SALBP-1. Furthermore, improvement procedures for SALBP-2 are developed and combined with tabu search, a recent strategy to overcome local optimality. Several optional elements of tabu search are discussed. Finally, the application of a nontraditional tabu search approach to solve SALBP-1 is investigated. Computational experiments validate the effectiveness of our new approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Baybars, I. (1986). “A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem”,Management Sci. 32, 909–932.

    Google Scholar 

  • Charlton, J. M., and C. C.Death. (1969). “A General Method for Machine Scheduling”,Internat. J. Production Res. 7, 207–217.

    Google Scholar 

  • Dar-El, E. M. (1975). “Solving Large Single-Model Assembly Line Balancing Problems—A Comparative Study”,AIIE Trans. 7, 302–310.

    Google Scholar 

  • Domschke, W., A.Scholl, and S.Voß. (1993).Produktionsplanung—Ablauforganisatorische Aspekte. Berlin: Springer.

    Google Scholar 

  • Glover, F. (1989). “Tabu Search—Part I”,ORSA Journal on Computing 1, 190–206.

    Google Scholar 

  • Glover, F. (1990). “Tabu Search—Part II’,ORSA Journal on Computing 2, 4–32.

    Google Scholar 

  • Glover, F., and M.Laguna. (1993). “Tabu Search’. In C. R.Reeves (ed.),Modern Heuristic Techniques for Combinatorial Problems, pp. 70–150. Oxford: Blackwell.

    Google Scholar 

  • Hackman, S. T., M. J.Magazine, and T. S.Wee. (1989). “Fast, Effective Algorithms for Simple Assembly Line Balancing Problems’,Oper. Res. 37, 916–924.

    Google Scholar 

  • Hillier, F. S. and K. C.So. (1993). “Some Data for Applying the Bowl Phenomenon to Large Production Line Systems”,Internat. J. Production Res. 31, 811–822.

    Google Scholar 

  • Hoffmann, T. R. (1963). “Assembly Line Balancing with a Precedence Matrix”,Management Sci. 9, 551–562.

    Google Scholar 

  • Hoffmann, T. R. (1992). “EUREKA: A Hybrid System for Assembly Line Balancing’,Management Sci. 38, 39–47.

    Google Scholar 

  • Hoffmann, T. R. (1993). “Response to Note on Microcomputer Performance of “FABLE” on Hoffmann's Data Sets’,Management Sci. 39, 1192–1193.

    Google Scholar 

  • Hübscher, R., and F.Glover. (1994). “Applying Tabu Search with Influential Diversification to Multiprocessor Scheduling’,Computers Ops. Res. 21, 877–884.

    Google Scholar 

  • Johnson, R. V. (1988). “Optimally Balancing Large Assembly Lines with “FABLE””,Management Sci. 34, 240–253.

    Google Scholar 

  • Johnson, R. V. (1993). “Note: Microcomputer Performance of “FABLE” on Hoffmann's Data Sets”,Management Sci. 39, 1190–1193.

    Google Scholar 

  • Klein, R., and A.Scholl. (1996). “Maximizing the Production Rate in Simple Assembly Line Balancing—A Branch and Bound Procedure”,Europ. J. Oper. Res. 91, 367–385.

    Google Scholar 

  • Moodie, C. L., and H. H.Young. (1965). “A Heuristic Method of Assembly Line Balancing for Assumptions of Constant or Variable Work Element Times”,J. Industrial Engineering 16, 23–29.

    Google Scholar 

  • Rachamadugu, R., and B.Talbot. (1991). “Improving the Equality of Workload Assignments in Assembly Lines”,Internat. J. Production Res. 29, 619–633.

    Google Scholar 

  • Scholl, A. (1993). “Data of Assembly Line Balancing Problems,” Working Paper, TH Darmstadt.

  • Scholl, A. (1994). “Ein B&B-Verfahren zur Abstimmung von Fließbändern bei gegebener Stationsanzahl”. In H.Dyckhoff, U.Derigs, M.Salomon and H. C.Tijms (eds.),Operations Research Proceedings 1993, pp. 175–181. Berlin: Springer.

    Google Scholar 

  • Scholl, A., and S. Voß. (1994). “A Note on Fast, Effective Heuristics for Simply Assembly Line Balancing problems,” Working Paper, TH Darmstadt.

  • Talbot, F. B., J. H.Patterson, and W. V.Gehrlein. (1986). “A Comparative Evaluation of Heuristic Line Balancing Techniques”,Management Sci. 32, 430–454.

    Google Scholar 

  • Voß, S. (1994). “Intelligent Search,” Manuscript, TH Darmstadt.

  • Voß, S. (1994). “Tabu Search in Manufacturing”. In H.Dyckhoff, U.Derigs, M.Salomon and H. C.Tijms (eds.),Operations Research Proceedings 1993, pp. 183–194. Berlin: Springer.

    Google Scholar 

  • Wee, T. S., and M. J. Magazine. (1981). “An Efficient Branch and Bound Algorithm for an Assembly Line Balacing Problem—Part II: Maximize the Production Rate,” Working Paper No. 151, University of Waterloo.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scholl, A., Voß, S. Simple assembly line balancing—Heuristic approaches. J Heuristics 2, 217–244 (1997). https://doi.org/10.1007/BF00127358

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00127358

Keywords

Navigation