Abstract
This paper presents a hybrid genetic algorithm for the simple assembly line problem, SALBP-1. The chromosome representation of the problem is based on random keys. The assignment of the operations to the workstations is based on a heuristic priority rule in which the priorities of the operations are defined by the chromosomes. A local search is used to improve the solution. The approach is tested on a set of problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baybars, L. (1986). “A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem.” Management Sci. 32, 909–932.
Bean, J.C. (1994). “Genetic Algorithms and Random Keys for Sequencing and Optimization.” ORSA Journal on Computing 6(2), 154–160.
Bock, S. and O. Rosenberg. (1997). “A New Distributed Fault-Tolerant Algorithm for the Simple Assembly Line Balancing Problem 1,” Technischer Bericht tr-rsfb-97-040.
Boctor, F.F. (1995). “A Multiple-Rule Heuristic for Assembly Line Balancing.” Journal of Operational Research Society 46, 62–69.
Domschke, W., A. Scholl, and S. Voß. (1993). Produktionsplanung—Ablauforganisatorische Aspekte. Berlin: Springer.
Easton, F.F. (1990). “A Dynamic Program with Fathoming and Dynamic Upper Bounds for the Assembly Line Balancing Problem.” Computers and Operations Research 17, 163–175.
Erel E. and S.C. Sarin. (1998). “A Survey of the Assembly Line Balancing Procedures.” Production Planning and Control 9(5), 414–434.
Gen, M., Y. Tsujimura, and Y. Li. (1996). “Fuzzy Assembly Line Balancing Using Genetic Algorithms.” Computers and Industrial Engineering 31(3–4), 631–634.
Ghosh, S. and R.J. Gagnon. (1989). “A Comprehensive Literature Review and Analysis of the Design, Balancing and Scheduling of Assembly Systems.” International Journal of Production Research 27, 637–670.
Goldberg, D.E. (1989). Genetic Algorithms in Search Optimization, and Machine Learning. Addison-Wesley, Reading, MA.
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.
Held, M., R.M. Karp, and R. Shareshian. (1963). “Assembly Line Balancing Dynamic Programming with Precedence Constraints.” Operations Research 11(3), 442–459.
Helgeson, W. and D. Birnie. (1961). “Assembly Line Balancing Using the Ranked Positional Weight Technique.” Journal of Industrial Engineering 12, 394–398.
Hoffmann, T.R. (1990). “Assembly Line Balancing: A Set of Challenging Problems.” International Journal of Production Research 28, 1807–1815.
Hoffmann, T.R. (1992). “EUREKA: A Hybrid System for Assembly Line Balancing.” Management Science 38, 39–47.
Johnson, R.V. (1988). “Optimally Balancing Large Assembly Lines with FABLE.” Management Science 34, 240–253.
Kilbridge, M. and L. Wester. (1961). “A Heuristic Method for Assembly Line Balancing.” Journal of Industrial Engineering 12, 292–298.
Klein, R. and A. Scholl. (1996). “Maximizing the Production Rate in Simple Assembly Line Balancing—A Branch and Bound Procedure.” European Journal of Operational Research 91, 367–385.
Moodie, C. and H. Young. (1965). “A Heuristic Method of Assembly Line Balancing for Assumptions of Constant or Variable Work Element Times.” Journal of Industrial Engineering 16, 23–29.
Nourie, F.J. and E.R. Venta. (1991). “Finding Optimal Line Balances with OptPack.” Operations Research Letters 10, 165–171.
Ponnambalam, S.G., P. Aravindan, and G.M. Naidu. (1999). “A Comparative Evaluation of Assembly Line Balancing Heuristics.” International Journal of Advanced Manufacturing Technology 15(8), 577–586.
Scholl, A. (1993). “Data of Assembly Line Balancing Problems,” Working Paper, TH Darmstadt.
Scholl, A. (1995). Balancing and Sequencing of Assembly Lines. Heidelberg: Physica-Verlag.
Scholl, A. and R. Klein. (1997). “SALOME: A Bidirectional Branch and Bound Procedure for Assembly Line Balancing.” INFORMS Journal on Computing 9, 319–334.
Scholl, A. and R. Klein. (1999). Balancing Assembly Lines Effectively: A Computational Comparison.” European Journal of Operational Research 114, 50–58.
Scholl, A. and S. Voß. (1994). “A Note on Fast, Effective Heuristics for Simple Assembly Line Balancing,” Working paper, TH Darmstadt.
Scholl, A. and S. Voß. (1996). “Simple Assembly Line Balancing—Heuristic Approaches.” Journal of Heuristics 2(3), 217–244.
Schrage, L. and K.R. Baker. (1978). “Dynamic Programming Solution of Sequencing Problems with Precedence Constraints.” Operations Research 26, 444–459.
Spears, W.M. and K.A. DeJong. (1991). “On the Virtues of Parameterized Uniform Crossover.” In Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230–236.
Sprecher, A. (1999). “A Competitive Branch-and-Bound Algorithm for the Simple Assembly Line Balancing Problem.” International Journal of Production Research 37(8), 1787–1816.
Talbot, F.B., J.H. Patterson, and W.V. Gehrlein. (1986). “A Comparative Evaluation of Heuristic Line Balancing Techniques.” Management Sci. 32, 430–454.
Tonge, F. (1961). A Heuristic Program of Assembly Line Balancing. Englewood Cliffs, NJ: Prentice-Hall.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gonçalves, J.F., de Almeida, J.R. A Hybrid Genetic Algorithm for Assembly Line Balancing. Journal of Heuristics 8, 629–642 (2002). https://doi.org/10.1023/A:1020377910258
Issue Date:
DOI: https://doi.org/10.1023/A:1020377910258