Line balancing for non-traditional assembly lines, mixed models, and sequence-dependent assembly times

Abstract Traditionally, the assembly line balancing problem dealt with balancing linear assembly lines given a precedence diagram of the jobs involved. The objective of this problem is either to maximize the workstations throughput, or minimize the number of workstations, given a cycle time. The job times are traditionally assumed to be independent of the assembly sequence. Recent technological and philosophical changes in the manufacturing area leading to job enrichment, mechanized assembly, non-synchronous assembly lines and non-traditional lines have reduced the practicality of traditional solutions. This paper presents an assembly line balancing problem in which the assembly times increase when a job is assembled late, due to extended fixturing and reachability difficulties. This paper presents a methodology for job enrichment introducing multiple occurrences of the same product in the same line, resulting in increased throughput of the line. All these issues are developed for a traditional linear lin...

[1]  Norman A. Schofield,et al.  Assembly line balancing and the application of computer techniques , 1980 .

[2]  S. D. Roberts,et al.  On a Multiproduct Assembly Line-Balancing Problem , 1970 .

[3]  James R. Jackson,et al.  A Computing Procedure for a Line Balancing Problem , 1956 .

[4]  Michael J. Magazine,et al.  Assembly line balancing as generalized bin packing , 1982, Oper. Res. Lett..

[5]  Gordon Johnson,et al.  Currently practiced formulations for the assembly line balance problem , 1983 .

[6]  Thomas L. DeFazio,et al.  An integrated computer aid for generating and evaluating assembly sequences for mechanical products , 1991, IEEE Trans. Robotics Autom..

[7]  Roger V. Johnson,et al.  A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities , 1983 .

[8]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[9]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[10]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[11]  Nick T. Thomopoulos,et al.  Mixed Model Line Balancing with Smoothed Station Assignments , 1970 .

[12]  Warren H. Thomas,et al.  Balancing Stochastic Assembly Lines , 1973 .

[13]  John L. Burbidge,et al.  The design of production systems , 1985 .

[14]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[15]  Roger V. Johnson Assembly line balancing algorithms: computation comparisons , 1981 .

[16]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[17]  Arthur C. Sanderson,et al.  Two criteria for the selection of assembly plans: maximizing the flexibility of sequencing the assembly tasks and minimizing the assembly time through parallel execution of assembly tasks , 1991, IEEE Trans. Robotics Autom..

[18]  Morton Klein On Assembly Line Balancing , 1963 .

[19]  E. H. Bowman Assembly-Line Balancing by Linear Programming , 1960 .

[20]  James H. Donnelly,et al.  Fundamentals of Management , 1984 .

[21]  Ezey M. Dar-El,et al.  MALB—A Heuristic Technique for Balancing Large Single-Model Assembly Lines , 1973 .

[22]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..

[23]  Nick T. Thomopoulos,et al.  Line Balancing-Sequencing for Mixed-Model Assembly , 1967 .

[24]  Edward P. C. Kao,et al.  On Dynamic Programming Methods for Assembly Line Balancing , 1982, Oper. Res..

[25]  Melvin Lehman,et al.  ON CRITERIA FOR ASSIGNING MODELS TO ASSEMBLY LINES , 1968 .

[26]  David Ben-Arieh,et al.  A methodology for analysis of assembly operations’ difficulty , 1994 .

[27]  Jan D. Wolter On the automatic generation of assembly plans , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[28]  Edward P. C. Kao,et al.  Computational experience with a stochastic assembly line balancing algorithm , 1979, Comput. Oper. Res..

[29]  James H. Patterson,et al.  An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem , 1984 .

[30]  Moshe Sniedovich Analysis of a Preference Order Assembly Line Problem , 1981 .

[31]  E. K. Lo,et al.  Economic evaluation of robot-based assembly systems , 1991 .

[32]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[33]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[34]  A. L. Arcus,et al.  COMSOAL: a computer method of sequencing operations for assembly lines , 1965 .