最佳化新產品設計開發流程 ... - enger.thu.edu.tw

1 48 (2009):49-61 49 50 (Yassine and Braha 2003 1993) (Beheshiti 1993 Susman 1992) (Directed graph) Petri-Nets (Ellis and Nutt 1993) (PERT) IDEF0 (Mayer, et al.)

2 1993) (Design Structure Matrix DSM) (Eppinger 1994 Browning and Eppinger 2002) Petri-Nets (CPM) IDEF0 DSM ( ) DSM (Steward 1981) DSM (Kusiak and Wang1993) (Weighting Directed Graph WDG) (Numerical Design Structure Matrix NDSM) (Partitioning algorithm) (Hierarchy algorithm) (Tearing algorithm) 51 1 3 ( 2 ): (1) ( 2 (a)): A B (2) ( 2 (b)).

3 , A B (3) ( 2 (c)) A B A B B A A B (Roberts 1976) =POG, {}noooO,..,,21= n {}mpppP,..,,21= m P O : (1) (2) { , , , , , , } {}0, , , , , ,1 NDSM 1.

4 A B A B A B(a) (b) (c) 2. (Design Structure Matrix DSM) ( 3) 0 1 : ==ijijijaaifaaorjiifa10 (1) 0=iia ijaa ja ia 1=ija 1=ija 0=ija 4 [0,1] [0~1] (Numerical Design Structure Matrix NDSM) : (1) NDSM (2) NDSM ija ia ja (3) NDSM i 0 j 0 NDSM ija ia ja ija.

5 ==ijijijaaifVaaorjiifa0 (2) {}0, , , , , ,1 V 5 WDG NDSM NDSM NDSM ABCDEFGA0011000B0000001C1100011D0100000E 0000000F0000000G0001010XY 3. A B A B A BABABABABABAB 4. 53 : : NDSM (Warfield 1994) NDSM : 1 : P A nnijpP =)( nnijnnpIAP = =)()( A nI n 1)()(+ = =nnnnIAIAP ( 3) P 2 : Q P.

6 TPPQI= =nnnnnnnnnnnnpppppppppppppppppLMOMMLLILM OMMLL212221212111212222111211 =nnnnnnnnnnppppppppppppppp22211222221221 112112112 LLOLLLL TP P Q 55 A 5 1. 1 2 3 4 5 6 1 2 3 4 5 6 7 Level 1 Level 2 Level 3 Level 4 5. WDG NDSM 54 + = =100000100000100000100000100010001001100 00000100010nIAR =1001001100111000001100011, = =10011111001111000011000112 RRR, = =100111111011111000110001123 RRR, = =100111111111111000110001134 RRR, = =100111111111111000110001145 RRR 54RR= 1 P: =1001111111111110001100011P Q : TPPQI= =111000110001100111111111110011111111111 10001100011I =1000001100011000001100011 3 : P P {}maaaS'.

7 ,',''21= nm 1 P i~j n (Hierarchy algorithm) 4 : 0 =0L m TD)1,,1,1(0L= TmlpppDP),,,(211L= 1 l , nm 1 TmldddD),,,(21L= {}1,0 iP 0=id 1=id 1=ie j jiLa=' {}1'110= = ijijeLLLSaLL (5) 1L 2L .. 1 jL NDSM 55 NDSM : 1: 2: P Q 3: 1 2 4: R )(SjiAij < uW iiA ij dW=1 NDSM i j jia ija 1, , , , , ,0 iA (II) (IO).

8 =+= + =111),(ijnijuijdijinjiWCWCII (6) =+= + =111),(iinjidijuijinjiWCWCIO (7) ),(/njiIOIIRiii = (8) n uW dW : (1) iA iII iIO (2) iiiIOIIR/= (3) iR R (4) R (5) NDSM A A A A A 22 1 : 5687654321 SSSSSSSS = 1111111111111111111111111111111011111P A 6 A (NDSM) 6 (Binary Boolean Matrix) 1 0 1 0 (3,4) P Q : Q, S1 ={a, b}, S2 ={c, d, e}, S3 ={f, g ,h}, S4 ={i, j, k, l, m, p}, S5 ={n, o}, S6 ={ q, r, s, v} t (S7) u (S8) 8 P ( 4) : TD)1,1,1,1,1,1,1,1(0= 1.

9 A. l. IC b. m. c. n. d. o. e. p. f. q. g. r. h. s. i. t. j. layo utu. k. v. abcde fgh i j k lmnopqr s t . 6. A (NDSM) =111111111111111111111111111111111111111 1111111111111111111111111111111111111111 1111111111111111111111111111111111111111 1111111111111111111111111111111111111111 1111111111111111111111111111111111111111 1111111111111111111111111111111111111111 111111111111111111111P ==11111111111111111111111111111111111111 1111111111111111111111111111111111111111 1 TPPQI 57 TDP)8,7,6,5,4,2,3,1(0= , {}baSL,11== TD)1,1,1,,1,1,1,1,0(1=, TDP)7,6,5,4,3,1,2,0(1= , {}hgfSL,,32== TD)1,1,1,,1,1,0,1,0(2=, TDP)6,5,4,3,2,0,1,0(2= , {}edcSL,,23== TD)1,1,1,,1,1,0,0,0(3=, TDP)

10 5,4,3,2,1,0,0,0(3= , {}pmlkjiSL,,,,,44== TD)1,1,1,,1,0,0,0,0(4=, TDP)4,3,2,1,0,0,0,0(4= , {}onSL,55== TD)1,1,1,,0,0,0,0,0(5=, TDP)3,2,1,0,0,0,0,0(5= , {}vsrqSL,,,66== TD)1,1,0,,0,0,0,0,0(6=, TDP)2,1,0,0,0,0,0,0(6= , {}tSL==77 TD)1,0,0,,0,0,0,0,0(7=, TDP)1,0,0,0,0,0,0,0(7= , {}uSL==88 7 6 (6,7,8) Aiab fghcde i j k lmpnoqr sv t . 1 2 3 4 5 6 7. A ab fhgced j i pk lmnovsqr t u a1 b1 .7 . C3C4C5C6C1 C2 8.)