Assembly System Reconfiguration Planning

被引:26
作者
Bryan, April [1 ]
Hu, S. Jack [1 ]
Koren, Yoram [1 ]
机构
[1] Univ Michigan, Dept Mech Engn, Ann Arbor, MI 48109 USA
来源
JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING-TRANSACTIONS OF THE ASME | 2013年 / 135卷 / 04期
关键词
reconfiguration planning; product family; reconfigurable manufacturing systems; life cycle costs; assembly system; DESIGN; ALGORITHMS; PRODUCTS;
D O I
10.1115/1.4024288
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Decreasing product life cycles and reduced product development times have led to a need for new strategies for coping with the rapid rate of product family design changes. In this paper, assembly system reconfiguration planning (ASRP) is introduced as a method for cost effectively designing several generations of assembly systems in order to produce a product family that gradually evolves over time. In the ASRP approach, the possible assembly systems for each generation are first considered and then the sequence of assembly system configurations that minimize the life cycle cost of the process are selected. A nonlinear integer optimization formulation is developed for finding the cost minimizing assembly system reconfiguration plan using the ASRP approach. Dynamic programming and genetic algorithm are used to solve the optimization problem. Simulation results indicate that the ASRP approach leads to the minimum life cycle costs of the assembly system, and the relative cost of reconfiguration and production have an impact on the assembly system reconfiguration plan selected. Comparison of the results of the dynamic program and genetic algorithm indicate that the dynamic program is more computationally efficient for small problems and genetic algorithm is preferred for larger problems.
引用
收藏
页数:13
相关论文
共 40 条
[1]   Grouping and selecting products: the design key of Reconfigurable Manufacturing Systems (RMSs) [J].
Abdi, MR ;
Labib, AW .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (03) :521-546
[2]   A Co-Evolution Model for Prediction and Synthesis of New Products and Manufacturing Systems [J].
AlGeddawy, Tarek ;
ElMaraghy, Hoda .
JOURNAL OF MECHANICAL DESIGN, 2012, 134 (05)
[3]   A parallel station heuristic for the mixed-model production line balancing problem [J].
Askin, RG ;
Zhou, M .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (11) :3095-3105
[4]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[5]   A survey on problems and methods in generalized assembly line balancing [J].
Becker, C ;
Scholl, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 168 (03) :694-715
[6]  
Bryan A, 2007, PROCEEDINGS OF THE ASME INTERNATIONAL CONFERENCE ON MANUFACTURING SCIENCE AND ENGINEERING - 2007, P803, DOI 10.1115/MSEC2007-31081
[7]   Co-evolution of product families and assembly systems [J].
Bryan, A. ;
Ko, J. ;
Hu, S. J. ;
Koren, Y. .
CIRP ANNALS-MANUFACTURING TECHNOLOGY, 2007, 56 (01) :41-44
[8]  
Bryan A., 2008, P ASME 2008 9 BIENN, P163
[9]   A CORRECT AND COMPLETE ALGORITHM FOR THE GENERATION OF MECHANICAL ASSEMBLY SEQUENCES [J].
DEMELLO, LSH ;
SANDERSON, AC .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1991, 7 (02) :228-240
[10]  
Denardo E.V., 2003, DYNAMIC PROGRAMMING