ÆÄÀÏ  Âü°íÀÚ·á BÇü[3].hwp
  [Size :
130 Kbyte
]
ºÐ·®   23 Page
°¡°Ý  1,700 ¿ø
|
ÀÚ·á¼³¸í
¥°.¼·Ð, , ¥±.Á¤Ã¥ºÐ¼®ÀÇ °³³ä°ú ð³±â¹ý, 1. Á¤Ã¥ºÐ¼®ÀÇ ÀÇÀÇ¿Í Â÷¿ø, 2. Á¤Ã¥ºÐ¼®(PA), 3. üÁ¦ºÐ¼®, 1)ÀÇÀÇ, 2)üÁ¦ºÐ¼®ÀÇ Æ¯¼º, 3)ºñ¿ëÆíÀͺм®(CBA-Cost Benefit Analysis), 4)ºñ¿ëÈ¿°úºÐ¼®(CEA : Cost Effectiveness Analysis), 4. °ü¸®°úÇÐ(OR), 1)ÀÇÀÇ, 2)Ư¡, 3)ORÀÇ Á¦±â¹ý, (1)°ü¸®Á¤º¸Ã¼Á¦(MS) , (2)EDPS(Electronic Data Processing System), (3)ÀΰøµÎ³úÇÐ(Cybemetics), (4)PERT¿Í CPM, (5)¼±Çü°èȹ(Linear Programming : LP)°ú ¹Î°¨µµ ºÐ¼®, (6)°ÔÀÓÀÌ·Ð(Game Theory), (7)´ë±âÇà·ÄÀÌ·Ð(Queuing theory, Waiting theory : QT, WT), (8)½Ã°è¿ºÐ¼®(time series analysis), (9)ȸ±ÍºÐ¼®(regression analysis), (10)¸ðÀǽÇÇè(Simulation), (11)¸ñÀû°èȹ¹ý(Goal Programming), (12)±³Â÷¿µÇâºÐ¼®(cross - impact analysis), (13)°¡Á¤ºÐ¼®(Assumptional analysis), (14) ÀÚÀ¯Åä·Ð(brainstorming), (15)¼ö¼Û³×Æ®¿öÅ© ¸ðÇü, (16)´Ù´Ü°èÀÇ»ç°áÁ¤¸ðÇö ¶Ç´Â ÃàÂ÷Àû °áÁ¤(ëòÞÖ̽ïÒâ§×âÖå : Decision Tree Theory), (17)µ¨ÆÄÀÌ ±â¹ý (Delphi technique), 4)ORÀÇ ÇѰè, , ¥². Á¤Ã¥Æò°¡ ±â¹ý, 1. Á¤Ã¥Æò°¡ÀÇ ÀÇÀÇ¿Í Çʿ伺, 1)ÀÇÀÇ, 2)Çʿ伺, 2.Á¤Ã¥Æò°¡ÀÇ ð³±â¹ý, 1) Æò°¡¼º »çÁ¤(evaluability assessment), 2) ¸ð´ÏÅ͸µ(monitoring), 3) Á¤Ã¥Æò°¡ÀÇ ÀΰúÀû Ã߷аú Ÿ´ç¼º, 4) Áø ½ÇÇèÀû ¹æ¹ý(true experiment model), 5) ÁØ ½ÇÇè ¹æ¹ý, 6) ºñ ½ÇÇèÀû ¹æ¹ý, 7) »ç¾÷°èȹÀ̷аú Çü¼ºÆò°¡, 8) ´É·ü¼º ºÐ¼®, , ¥³.°á·Ð, , *Âü°í¹®Çå*, , FileSize : 131K
¸ñÂ÷/Â÷·Ê
¥°.¼·Ð
¥±.Á¤Ã¥ºÐ¼®ÀÇ °³³ä°ú ð³±â¹ý
1. Á¤Ã¥ºÐ¼®ÀÇ ÀÇÀÇ¿Í Â÷¿ø
2. Á¤Ã¥ºÐ¼®(PA)
3. üÁ¦ºÐ¼®
1)ÀÇÀÇ
2)üÁ¦ºÐ¼®ÀÇ Æ¯¼º
3)ºñ¿ëÆíÀͺм®(CBA-Cost Benefit Analysis)
4)ºñ¿ëÈ¿°úºÐ¼®(CEA : Cost Effectiveness Analysis)
4. °ü¸®°úÇÐ(OR)
1)ÀÇÀÇ
2)Ư¡
3)ORÀÇ Á¦±â¹ý
(1)°ü¸®Á¤º¸Ã¼Á¦(MS)
(2)EDPS(Electronic Data Processing System)
(3)ÀΰøµÎ³úÇÐ(Cybemetics)
(4)PERT¿Í CPM
(5)¼±Çü°èȹ(Linear Programming : LP)°ú ¹Î°¨µµ ºÐ¼®
(6)°ÔÀÓÀÌ·Ð(Game Theory)
(7)´ë±âÇà·ÄÀÌ·Ð(Queuing theory, Waiting theory : QT, WT)
(8)½Ã°è¿ºÐ¼®(time series analysis)
(9)ȸ±ÍºÐ¼®(regression analysis)
(10)¸ðÀǽÇÇè(Simulation)
(11)¸ñÀû°èȹ¹ý(Goal Programming)
(12)±³Â÷¿µÇâºÐ¼®(cross - impact analysis)
(13)°¡Á¤ºÐ¼®(Assumptional analysis)
(14) ÀÚÀ¯Åä·Ð(brainstorming)
(15)¼ö¼Û³×Æ®¿öÅ© ¸ðÇü
(16)´Ù´Ü°èÀÇ»ç°áÁ¤¸ðÇö ¶Ç´Â ÃàÂ÷Àû °áÁ¤(ëòÞÖ̽ïÒâ§×âÖå : Decision Tree Theory)
(17)µ¨ÆÄÀÌ ±â¹ý (Delphi technique)
4)ORÀÇ ÇѰè
¥². Á¤Ã¥Æò°¡ ±â¹ý
1. Á¤Ã¥Æò°¡ÀÇ ÀÇÀÇ¿Í Çʿ伺
1)ÀÇÀÇ
2)Çʿ伺
2.Á¤Ã¥Æò°¡ÀÇ ð³±â¹ý
1) Æò°¡¼º »çÁ¤(evaluability assessment)
2) ¸ð´ÏÅ͸µ(monitoring)
3) Á¤Ã¥Æò°¡ÀÇ ÀΰúÀû Ã߷аú Ÿ´ç¼º
4) Áø ½ÇÇèÀû ¹æ¹ý(true experiment model)
5) ÁØ ½ÇÇè ¹æ¹ý
6) ºñ ½ÇÇèÀû ¹æ¹ý
7) »ç¾÷°èȹÀ̷аú Çü¼ºÆò°¡
8) ´É·ü¼º ºÐ¼®
¥³.°á·Ð
*Âü°í¹®Çå*