A complexity model for sequence planning in mixed-model assembly lines

Abstract Sequence planning is an important problem in assembly line design. It is to determine the order of assembly tasks to be performed sequentially. Significant research has been done to find good sequences based on various criteria, such as process time, investment cost, and product quality. This paper discusses the selection of optimal sequences based on complexity induced by product variety in mixed-model assembly line. The complexity was defined as operator choice complexity, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. The complexity measure and its model for assembly lines have been developed in an earlier paper by the authors. According to the complexity models developed, assembly sequence determines the directions in which complexity flows. Thus proper assembly sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming. Methodologies developed in this paper extend the previous work on modeling complexity, and provide solution strategies for assembly sequence planning to minimize complexity.

[1]  W. E. Hick.  Quarterly Journal of Experimental Psychology , 1948, Nature.

[2]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[3]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[4]  Alain Delchambre,et al.  An integrated approach for product family and assembly system design , 2003, IEEE Trans. Robotics Autom..

[5]  Janet Efstathiou,et al.  Advances on measuring the operational complexity of supplier-customer systems , 2006, Eur. J. Oper. Res..

[6]  C Merengo,et al.  Balancing and sequencing manual mixed-model assembly lines , 1999 .

[7]  Armin Scholl,et al.  A survey on problems and methods in generalized assembly line balancing , 2006, Eur. J. Oper. Res..

[8]  Katta G. Murty,et al.  Network programming , 1992 .

[9]  Brahim Rekiek,et al.  Designing mixed-product assembly lines , 2000, IEEE Trans. Robotics Autom..

[10]  C G Drury,et al.  Information processing in assembly tasks--a case study. , 1988, Applied ergonomics.

[11]  L. Bianco,et al.  Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming , 1994 .

[12]  Saurabh Gupta,et al.  Product family-based assembly sequence design methodology , 1998 .

[13]  Candace Arai Yano,et al.  Sequencing to minimize work overload in assembly lines with product options , 1991 .

[14]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[15]  R. Hyman.  Stimulus information as a determinant of reaction time. , 1953, Journal of experimental psychology.

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

[17]  S. Jack Hu,et al.  Modeling of Manufacturing Complexity in Mixed-Model Assembly Lines , 2008 .

[18]  Susanne M. Gatchell.  The Effect of Part Proliferation on Assembly Line Operators' Decision Making Capabilities , 1979 .

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

[20]  Pedro M. Vilarinho,et al.  A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations , 2002 .