A dynamic programming based process planning selection strategy considering utilisation of machines

被引:24
作者
Chang, HC
Chen, FF [1 ]
机构
[1] Virginia Polytech Inst & State Univ, Grado Dept Ind & Syst Engn, Flexible Mfg Syst Lab, Blacksburg, VA 24061 USA
[2] Summit Polymer Inc, Kalamazoo, MI USA
关键词
computer-aided process planning; computer integrated manufacturing; dynamic programming; process planning and shop-floor activities integration;
D O I
10.1007/s001700200002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Computer-aided process planning (CAPP) has been recognised as a key element in computer-integrated manufacturing (CIM). Despite the fact that tremendous efforts have been made to develop CAPP systems, the benefits of CAPP in real-life manufacturing environments are not obvious. One of the main difficulties in applying CAPP in real manufacturing settings is the missing link between generated process plans and shop-floor activities. The assumptions that the shop floor remains static and there are unlimited resources available have caused a typical CAPP system to make a repetitive selection of the same most desirable machines for manufacturing different parts. When Process plans for various parts are finally sent to the shop floor, process bottlenecks normally arise, making the generated plans ineffective. Some efforts have been made in the integration of process planning and shop floor activities; however, the problems associated with the lengthy time and impractical attempts at the generation of process plans, remain unsolved. Since in most cases, it is possible that several alternatives exist for machining a part by using different equipment, a stage-type network structure can be constructed. This paper introduces a dynamic programming based process plan selection strategy, enabling the efficient solution of this stage-type network problem. In this proposed strategy,, the use of workstations is also taken into consideration so that the resulting plan is valid for the conditions that exist on the shop floor at the time an order is released. A case study has been Provided to substantiate the effectiveness of this proposed strategy.
引用
收藏
页码:97 / 105
页数:9
相关论文
共 21 条
[1]  
DETAND J, 1993, THESIS DEP MECH ENG
[2]   A FEATURE-BASED DYNAMIC PROCESS PLANNING AND SCHEDULING [J].
DONG, J ;
JO, HH ;
PARSAEI, HR .
COMPUTERS & INDUSTRIAL ENGINEERING, 1992, 23 (1-4) :141-144
[3]  
Dreyfus S.E., 1977, The Art and Theory of Dynamic Programming
[4]  
El Maraghy H. A., 1992, P 24 CIRP INT SEM MA, P1
[5]   Bidding-based process planning and scheduling in a multi-agent system [J].
Gu, P ;
Balasubramanian, S ;
Norrie, DH .
COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 32 (02) :477-496
[6]   A PROGRESSIVE APPROACH FOR THE INTEGRATION OF PROCESS PLANNING AND SCHEDULING [J].
HUANG, SH ;
ZHANG, HC ;
SMITH, ML .
IIE TRANSACTIONS, 1995, 27 (04) :456-464
[7]   FLEXIBLE PROCESS PLANS - THEIR VALUE IN FLEXIBLE AUTOMATION SYSTEMS [J].
HUTCHINSON, GK ;
PFLUGHOEFT, KA .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1994, 32 (03) :707-719
[8]  
Iwata K., 1989, P CIRP INT WORKSH CO, V21-22, P73
[9]   A collaborative process planning and scheduling system [J].
Kempenaers, J ;
Pinte, J ;
Detand, J ;
Kruth, JP .
ADVANCES IN ENGINEERING SOFTWARE, 1996, 25 (01) :3-8
[10]  
KRUTH JP, 1992, ANN CIRP, V41, P489