An Optimized Resolution for Software Project Planning with Improved Max Min Ant System Algorithm

Transcription

1 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) 5-38 h://dxdoiorg/457/iue564 An Oiized Reoluion for Sofware Proec Planning wih Iroved Max Min An Sye Algorih WanJiang Han HeYang Jiang TianBo Lu XiaoYan Zhang and WeiJian Li School Of Sofware Engineering Beiing Univeriy of Po and Telecounicaion Beiing 876 China Inernaional School Beiing Univeriy of Po and Telecounicaion Beiing 876 China Abrac Sofware Proec Manageen (SPM) i one of he riary facor o ofware ucce or failure SPM ha been he boeck in ofware engineering area We aly an iroved Max Min An Sye algorih o Sofware Proec Planning o ake he aroriae worker-ak aignen in a ofware roec o he and duraion of he roec are iniized Exerienal reul how ha uing hi Iroved An Colony Oiizaion algorih can obain a feaible oluion which can hel u o ge he aroriae PERT Grah and Gan Char of he ofware roec hen we can obain he iniized roec duraion and So Sofware roec anageen can been iroved Keyword: An Colony Oiizaion Sofware roec anageen Sofware Proec Planning Max Min An Sye Algorih Inroducion Sofware roec anageen i a colex and difficuly ob eecially in lanning and conrolling Sofware roec lanning can be one of he o criical aciviie in he SPM roce Wihou a realiic and obecive ofware roec lan he ofware develoen roce canno be anaged in an ecive way So we need o oiize roec lanning The Sofware Proec Scheduling Proble (SPSP) i an ecific Proec Scheduling Proble [-] which ake he aroriae eloyee-ob aignen ha iniize and duraion for he whole roec and he ak-recedence and reource conrain are aified [3-5] While in Planning Sofware Proec we hould aign aroriae eloyee o roec ak according o heir kill The oial oluion can iniize he duraion and of he roec There are hree general ofware roec lanning aroache: a exerience andard guideline and uor ool Exerienced anager rely uon heir a exerience and exerience of ucceful anager o creae lan Ofen a finihed roec docuen and guideline are available o ue a odel for roec lan The an colony oiizaion (ACO) heuriic reened by Colorni e al [6] and laer exended by everal udie [7] ue a war inelligence aroach o olve he raveling alean roble In hi well-known NP-Hard roble a e of n ciie u be viied by one ingle raveling alean The goal i o iniize he oal diance gh[67] and Gabardella and Dorigo [8] and oher have creaed couaional agen ha iic he behavior of real an going fro heir ne o a food ource To do hi he arificial an are laced on a grah and forced o ove Each ingle oveen of he an on he grah generae anoher iece of he oluion The e of ove generae he full roble oluion [9-] ISSN: IJMUE Coyrigh c 5 SERSC

2 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) Proec cheduling roble which ha been widely udied ince early 96 i o deerine he chedule of allocaing reource o a o balance he oal and he coleion ie The general reource-conrained roec cheduling roble (RCPSP) arie when a e of inerrelaed aciviie (recedence relaion) i given and when each aciviy can be erfored in one of he everal way [] Alba firly reened he odel of he SPSP and Geneic Algorih (GA) [] Chang rooed a Tie-line baed odel for SPSP uing Geneic Algorih [3] Xiao rooed he An Colony Sye (ACS) o olve SPSP [4] and laer Crawford gave a new oluion by uing Max Min An Sye (MMAS) in Crawford Soo Johnon and Monfroy [5] Luna ake a calabiliy analyi of uli-obecive eaheuriic olving SPSP [6] An Colony Oiizaion algorih (ACO) algorih ake ue of ile agen called an which ieraively conruc candidae oluion o a cobinaorial oiizaion roble The an oluion conrucion i guided by heroone rail and robledeenden heuriic inforaion [7] The Max Min An Sye (MMAS) i an ACO algorih ha build direcly uon An Sye incororaing a uch ore aggreive heroone udae rocedure and echani o avoid earch agnaion MMAS eablihe a iniu and axiu value for he heroone and rovide ha only he be an can udae he heroone rail MMAS can achieve beer earch erforance han ACO algorih by increaing he exloiaion of he be oluion found during he earch roce [7] Thi aer deal wih ofware roec lanning eecially cheduling roble Baed on he work of Broderick Crawford [8] RF Tavare Neo [9] we reen an oiized reoluion which coni in iroving Max Min An Sye algorih Uing hi algorih o olve he Sofware Proec Scheduling Proble conducing exerien o how how o build roec Criical Pah Mehod (CPM) grah Gan Char and Co baeline The Model of Sofware Proec Planning The RCPSP i o olve NP- hard roble I i ued o chedule he ak of a roec ubec o recedence and reource conrain To generae a chedule i need o deerine order of ak which aify ak recedence conrain and ake ak li [] Sofware roec lanning include develoing a worker-ak chedule for a ofware roec We hould conider eloyee kill and reuneraion and aign he o roec ak according o ak requireen [ ] Our goal i o obain he reul of iniized and duraion for he whole roec In he odel of ofware roec lanning here are hree ioran reource: ak eloyee and kill The ak are he ob needed o colee he roec The eloyee are he worker who have oe kill and work in he ak which require a e of kill Thi odel can ake an aroriae allocaion by he kill required for he ak and he kill of eloyee Aue P i a roec which ha a e of ak rereened by where n i he oal nuber of ak Thi roec need a e of eloyee o work on he roec ak The e of eloyee i defined a E { e e e} where i he oal nuber of Eloyee Each ak require a e of kill and an or We reen a e of kill a S { k} where k i he oal nuber of kill T } { n 6 Coyrigh c 5 SERSC

3 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) k Each ak ha wo aribue: and rereen he workload of he ak k i a e of kill for he ak Now we define M a oluion arix which i eloyee allocaion odel hown a Eq () n n n () i [] Where which rereen he degree of dedicaion of eloyee o ak If he eloyee i ake 5 ercen of hi ie on he roec I i a n arix of Tak and Eloyee where eloyee are aigned o each Tak which ize i he dienion of arix correonded o he eloyee nuber and he ak nuber The oluion generaed in hi arix for he roec will a all eloyee o he roec ak and hen generae an oial eruaion of ofware ak in he end we can ge he be oial oluion wih iniu and duraion for he whole roec and we can lan he ofware roec beer To generae an oiized oluion correonding conrain hould be conidered Firly he Marix decribed above i feaible econdly he and duraion for he whole roec i inial Thirdly roec i he lowe In order o obain a feaible arix M we define oe conrain For i one eloyee or ore are aigned o all roec ak reened in Eq () i 5 i n n n () Oher conrain i ha he eloyee aigned o he ak kill o colee he ak Thi i reened in Eq (3) k k ei Where { n} n i he ak nuber ha all he neceary So Eq (4) decribe a feaible arix M which how dedicaion of eloyee o very ak I can give u a feaible oluion o lan a roec (3) (4) Coyrigh c 5 SERSC 7

4 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) 3 The Fine Funcion To generae an oiized oluion we will reen a fine funcion o araie he qualiy of he oluion We will ake he following e [8] Se : Building ak-recedence-grah Figure how he ak recedence grah (TPG) of a roec and Table decribe heir neceary kill and or Figure TGP wih T { 3 4 5} Skill ( k ) { { } } 3 { 3 } 4 { 3} 5 { } Effor ( ) Table Neceary Skill and Effor for Tak Se : Eloyee allocaion For hi roec we have a e of eloyee kill axiu degree of dedicaion e axd E { e e } and reuneraion and each one ha a e of e re illuraed in Table Table Skill Dedicaion and Reuneraion for Eloyee Skill ( e k ) axiu degree of dedicaion( Reuneraion( e re ) e axd ) e { 3} e 5 { } $5 $6 Se 3: The duraion of all ak Aue he duraion of ak i where n i he ak nuber which can be calculaed according o he Eq (5) i i (5) here i he eloyee nuber 8 Coyrigh c 5 SERSC

5 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) ini For ak he iniializaion ie i reened a and he erinaion ie i reened a we can ue he recedence relaionhi decribed a TPG o er er calculae and a in Eq (6) and Eq (7) ini In Eq (6) if a ak i wihou recedence he iniializaion ie i If ak wih recedence he erinaion ie for all reviou ak u be calculaed firly ini ini ax{ l er if No recedence ( ) E } ele i (6) Uing he iniializaion ie he erinaion ie and he duraion for ak we can generae a Criical Pah Mehod (CPM) grah and Gan char To calculae he oal gh of he roec we only need erinaion ie of la ak hi i decribed in Eq (8) Se 4: The of he roec To calculae he of he whole roec we need firly o calculae he of each ak a er ax{ ini er k k { uing Eq (9) hen calculae he oal k }} according o he Eq () (7) (8) e i i re i Where i he oal nuber of Eloyee n (9) () Where n i he oal nuber of ak Se 5: The fine funcion Our goal i o iniize he oal duraion and he oal o a fine funcion i rooed a in Eq () where w and w are he iorance of which ee he differen agniude For hi of w and Average gh araeer by he correonding in he ae agniude f ( x) w w Average can be he iniializaion of and and can be he iniializaion Then ulilying he he uni are canceled and he value are Se 6: Rik eleen An eleen no conidered i roec ha ay increae he and duraion of he roec We can define roec a To calculae i we ue a funcion exoure a i reened in Eq () i () Coyrigh c 5 SERSC 9

6 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) P i Where = () i i robabiliy of occurrence I i i iac on he ak Now we can calculae he roec in he whole roec uing he Eq (3) n i i i I i We can deerine if he oluion i feaible In hi cae i feaible when he oluion can colee all ak and he fine funcion i iniized and no or lea ha ean he i iniized 4 An Iroved MMSA Algorih for Sofware Proec Plan In rincile ACO algorih can be alied o any cobinaorial oiizaion roble by defining oluion coonen which he an ue o ieraively conruc candidae oluion and on which hey ay deoi heroone[8-9] The MMAS raegy ha a well-defined heroone range ioed by wo conan ha delii he uer and lower bound Togeher wih an elii raegy which allow only he an wih be oluion o deoi heroone hi algorih i according o Dorigo and Blu becoing a highly ucceful ACO variaion[9][] Thi ecion decribe how o ada hi iroved Max-Min An Sye (IM-MMSA) Algorih o ofware roec lan Firly eablih an aroriae conrucion grah hen define he ue of heroone Thi algorih ake he aociaion of eloyee o roec ak 4 Conrucion Grah for Sofware Proec The conrucion grah i he grah ha he an ravel hrough Then a oluion can be conruced The an ar fro an iniial node and hen elec he node according o a robabiliy funcion Thi funcion i given by he heroone and heuriic inforaion of our roble heir relaive influence i given by α and β reecively [-3] We conruc a direced grah by uing he heuriic inforaion and heroone o The eloyee hould be aigned o a roec ak and heir dedicaion o a ak i rereened in he grah TGP Wih hi rereenaion we can define he conrucion grah The rooed conrucion grah rereen he aociaion of eloyee and heir dedicaion o a ak Thi rereenaion i conruced for each ak in he TGP and i divided ino a grah wih node and edge Therefore he conrucion grah include all eloyee and heir raio of dedicaion conribuion for he roec ak So we define a variable deniy which i deniy of node reened a following (3) deniy lea Where lea i he lowe degree of dedicaion o a ak Thi rucure i reened in Figure The eloyee dedicaion o a ak can be or ineger ulile of lea Firly generae a ar node and iner ino fir colun Secondly generae he i colun wih i { } Each colun coni in deniy node Third conruc an end node and u ino he la colun Fourh conruc edge add edge beween colun The an will ravel fro he ar node o he end node chooing edge fro he colun o colun wih no reurning The an chooe only one node each colun 3 Coyrigh c 5 SERSC

7 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) When a our i finihed we can obain he dedicaion of eloyee i o ak reened in Eq (3) which i he eleen ( i ) k lea Where k i he node in coluni ( i ) of oluion Marix (3) e e e Figure Conrucion Grah i a Marix CG for a Tak The an ravel hrough he conrucion grah baed on a robabiliic deciion o i and by a locally elec way Thi robabiliic choice i biaed by he heroone rail available heuriic inforaion So an chooe eloyee i in colun wih a robabiliy reened in Eq (4) i i i i if { d } den l i i oherwie (4) i i where i he heroone and i he heuriic inforaion of he roble on he ah beween node i o in he grah CG for ak and are wo fixed araeer which are ued o deerine he heroone and heuriic influence 4 The Pheroone Udae Sraegy The heroone udae raegy i hown in Eq (5) and (6) in which he udaed value of he heroone on he rail Thi udae raegy will ake ino accoun all oluion generaed by he an And i enable he heroone deoi only on rail ued by an ha found he be oluion [][4] id ( ) (5) ud i ( w where roec w of evaoraion i he oal of ofware roec w i [] w (6) i he oal duraion i and are he iorance of and i a rae If i high he new heroone value i le influenced by w w bu uch influenced by he reviou heroone value vice vera And i i aociaed wih qualiy of he curren oluion of ud an ud an i ieraion-be an We ) ud ud Coyrigh c 5 SERSC 3

8 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) can ue an udaing heroone raegy conidering duraion and of he roec a (6) 43 Iroved MMAS Algorih To irove MMAS Algorih a iniu heroone hrehold τ hold value i ued o onior he earch erforance of an [5-9] The τ hold value hould no be higher han he axiu heroone rail lii ( τ ax ) and lower han he τ in value a hown in Eq (7) The τ hold value i e a a aricular value during he ar of he algorih and changed according o he earch erforance Whenever i i lower τ hold he value of ha aricular arial oluion will be changed o ax han a hown in Eq(8) Thereafer Thi iroved Max-Min An Sye Algorih allow ha aricular arial oluion o be involved in he ucceive oluion conrucion e in< τ hold < ax (7) i = ax when i < τ hold (8) The benefi of hi iroveen i ha whenever he i value dro o a low level he aricular arial oluion will no be excluded fro he ucceive oluion conruc Thi hel o increae he exloraion or diverificaion of he earch 44 Algorih Decriion Thi Iroved MMSA Algorih for Sofware Proec Plan i Decribed a Follow Inu: The inforaion of Sofware roec Iniialize he heroone value While erinaion condiion no e do For g = o G do iniialize roce of an For = o do For ak = o do an ravel on he arix CG chooing eloyee and heir dedicaion o a ak ak ak An oring arial roue for An τ ax τ hold τ in End for enure feaible Marix uing Eq () calculae he fine of he oluion uing Eq () End for elec he be oluion udae heroone value a Eq (5) (6)(7)(8) End for elec he be global oluion (oional) aly heroone udae for global-be End while (ieraion i colee) Ouu: An oiized oluion 3 Coyrigh c 5 SERSC

9 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) Firly he algorih read he roec inforaion which rovide he neceary daa of ofware roec uch a ak required kill eloyee ak recedence inforaion he e of kill of each eloyee and heir reuneraion alo inforaion Then we have o li oeraion o he ak and hen uing above algorih o generae oluion To obain he oial oluion we ue Eq () ha i he fine funcion which iniize he and duraion for he whole roec Fro he oial oluion we can ge he dedicaion arix hen we can lan ofware roec 5 Exerienal Reul In hi ecion we will how an exerien and i reul Thi exerien i o lan a ofware roec where a e of eloyee u be aigned o a e of ak o all ak are coleed by eloyee who have he neceary kill o accolih ak Thi aignen hould iniize he and duraion of he whole roec The eloyee have reuneraion and everal kill and hey can work on ulile ak during he workday Fir we decribe ofware roec inance The e of all kill aociaed wih hi { 3} ofware roec i he e of ak neceary for hi roec i Figure 3 how he ak- recedence-grah TPG The e of { } eloyee i which ean 4 eloyee working on hi roec heir neceary kill and reuneraion are illuraed in Figure4 Tha ean a ube of he union of he kill he eloyee aigned o he ak and heir The o relevan reource in roec Scheduling i he roec eloyee { e e e3 e4} Figure 3 TGP wih T { } { } For hi roec Thee ak are Planning High-level deign Low-level deign Tecae deign Coding Sye Teing Acceance Teing reecively e k { 3} e k { 3} re e $6 re e k 3 { } re 3 e k 4 { 3} re 4 e $ 6 e $ 5 e $ 5 Figure 4 Skill and Reuneraion of Eloyee For hee ak in Figure 3 we can ee heir neceary kill and or in Figure 5 and in Figure 6 Coyrigh c 5 SERSC 33

10 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) k { 3} k k 5 { } { 3} k 3 k 6 { 3} { } Figure 5 Neceary Skill for Tak k 4 k 7 { } { } Figure 6 Neceary Effor for Tak The algorih wa ileened in Java uing a Inel core i8 Ghz 8 GB of RAM PC running Window 8 Profeional And ran 5 rial for hi inance and we reor he average value In he end we will find feaible oluion 5 Model Paraeer In our exerien odel araeer hould follow he rule wih higher availabiliy or horer execuion ie To chooe aroriae araeer we conduced a erie of exerien and cae cro lo of reference and lieraure We chooe he araeer a follow: and nuber of ieraion i 5 Exerienal Reor In hi ecion exerienal reul are reened In Figure 7 how he fine wih differen ieraion by 5 rial We obain he be oluion fro ieraion 4 Fro he be oluion we can ge he eloyee dedicaion o each ak a in (9) Figure7 The Fine Funcion (9) 34 Coyrigh c 5 SERSC

11 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) Fro (9) and ak or decribed above We can coue he gh ie for each ak a reened in Figure 8 Then we can coue he of each ak reened in Figure 9 In hi way we can obain he iniializaion ie and he erinaion ie for each ak o we can ge he oal gh of he roec =8 and he oal $ 34 { } Figure 8 The Duraion for Each Tak 4 Figure9 The Duraion for Each Tak Fro hee reul we can develo he roec CPM grah dilayed in Figure and Gan char howed in Figure In he Figure we can ee he criical ah i o he hore aoun of ie needed o colee hi roec i $4 $45 8 $ 33 5 $ $44 $58 7 $88 Figure PERT Grah Figure Gan Char Coyrigh c 5 SERSC 35

12 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) In order o conrol roec beer we hould obain baeline For hi according o he Gan char and he of he whole roec we can ge he baeline a Figure Figure Co Baeline Now we have finihed he roec lan 6 Concluion Thi aer reened an oiized reoluion for Sofware Proec Plan uing an iroved Max Min An Sye algorih By i we can obain a feaible oluion Through hi oluion and TPG we can coue he gh ie for each ak draw PERT char hen ge he criical ah ge he oal gh of he roec Then we can arrange roec chedule by ak heir required kill and eloyee In he la we can achieve an oiized oluion The exerien were erfored and howed he reul A fuure work we will conanly irove he algorih and oluion ean and will inegrae ean and roec arrangeen o we can ileen roec arrangeen auonoouly Acknowledgeen Thi work wa uored in ar by he Naional Naural Science Foundaion of China (Gran No 6773) Reference [] Laalaoui Y and Bouguila N Pre-run-ie cheduling in real-ie ye:curren reearche and arificial inelligence erecive Exer Sye wih Alicaion vol 4 no 5 (4) 96 [] Chen R-M Paricle war oiizaion wih uificaion and deigned echani for reourceconrained roec cheduling roble Exer Sye wih Alicaion vol 38 no 6 () 7 7 [3] Alba E and Chicano F Sofware roec anageen wih ga Inforaion Science vol 77 no (7) 38 4 [4] C K Chang Hin Yi J Yu D Dan Z and Yuia G Tie-line baed odel for ofware roec cheduling wih geneic algorih Inforaion and Sofware Technology vol 5 no (8) 4 54 [5] Nan N and Harer D E Iac of budge and chedule reure on ofware develoen cycle ie and or IEEE Tranacion on Sofware Engineering vol 35 no 5 (9) [6] Colorni A Dorigo M and Maniezzo V Diribued oiizaion by an colonie In: Euroean conference of arificial life; (99) 34 4 [7] Dorigo M Maniezzo V and Colorni A The an ye:oiizaion by acolony of cooeraing agen IEEE Tranacionon Sye ManandCyberneic Par B 996; vol 6 (996) Coyrigh c 5 SERSC

13 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) [8] Gabardella L M and Dorigo M Solving yeric and ayeric By an colonie In:Proceeding of he IEEE conference on evoluionary couaion ICEC96 IEEE Pre ; (996) 6 67 [9] R F Tavare Neo and M Godinho Filho An an colony oiizaion aroach o a eruaional flowho cheduling roble wih ouourcing allowed Couer & Oeraion Reearch vol 38 () [] Dorigo M and Blu C An colony oiizaion heory: a urvey Theoreical Couer Science vol 344 no 3 (5) [] Siaak Baradaran S M T Faei Ghoi Mahdi Mobini and SS Hahein A hybrid caer earch aroach for reource-conrained roec cheduling roble in PERT-ye nework Advance in Engineering Sofware vol 4 () [] Alba E and Chicano F Sofware roec anageen wih ga Inforaion Science vol 77 no (7) 38 4 [3] Carl K C Hin-yi J Yu Di Dan Zhu & Yuia Ge Tie-line baed odel for ofware roec cheduling wih geneic algorih Inforaion and Sofware Technology vol 5 no (8) 4 54 [4] Xiao J Ao X T and Tang Y Solving ofware roec cheduling roble wih an colony oiizaion Couer and Oeraion Reearch vol 4 no (3) [5] Crawford B Soo R Johnon F and Monfroy E An can chedule ofware roec In C Sehanidi (Ed) HCI inernaional 3 oer exended abrac counicaion in couer and inforaion cience Berlin Heidelberg: Sringer vol 373 (3) [6] Luna F González-álvarez D L Chicano F and Vega-Rodríguez M A The ofware roec cheduling roble: A calabiliy analyi of uli-obecive eaheuriic Alied Sof Couing vol 5 no (4) [7] Süzle T and Hoo H H Max-in an ye Fuure Generaion Couer Sye vol 6 no 8 () [8] Broderick C Ricardo S Franklin J Eric M Fernando P A Max Min An Sye algorih o olve he Sofware Proec Scheduling Proble Exer Sye wih Alicaion vol 4 (4) [9] R F Tavare Neo M Godinho Filho An an colony oiizaion aroach o a eruaional flowho cheduling roble wih ouourcing allowed Couer & Oeraion Reearch vol 38 () [] Kihor N V and Dineh B H Sofware Proec Planning Uing An Colony Oiizaion (SPP- ACO) Inernaional Journal of Couer Science And Technology vol 4 no 4 (3) [] Berrichi A Yalaoui F Aodeo L and Mezghiche M Bi-obecive an colony oiizaion aroach o oiize roducion and ainenance cheduling Couer and Oeraion Reearch vol 37 no 9 () [] Dorigo M and Di Caro G An colony oiizaion: A new ea-heuriic In Proceeding of he 999 congre on evoluionary couaion IEEE Pre (999) [3] Dorigo M Maniezzo V and Colorni A An ye: Oiizaion by a colony of cooeraing agen IEEE Tranacion on Sye Man and Cyberneic Par B: Cyberneic vol 6 no (996) 9 4 [4] Xun P Xian P Y Xian L L Oial Sraegie for Job Scheduling in Grid Uing Max-Min An Sye Journal of Convergence Inforaion Technology(JCIT) vol 7 no 5 () [5] Phen C S Kuan Y W Koarudin A Technique for Iroving he Max-Min An Sye Algorih Proceeding of he Inernaional Conference on Couer and Counicaion Engineering 8 May 3-5 (8) Kuala Luur Malayia [6] A R S Aaral On he exac oluion of a faciliy layou roble Euroean Journal of Oeraional Reearch vol 73 no (7) [7] E Duan and I Or The quadraic aignen roble in he conex of he rined circui board aebly roce Couer & Oeraion Reearch vol 34 no (7) [8] Barreo A Barro M d O and Werner C M L Saffing a ofware roec: A conrain aifacion and oiizaion-baed aroach Couer and Oeraion Reearch vol 35 no (8) [9] Ching-eh W Wei-chun C Ihwar K S A Meric-Baed Muli-Agen Sye for Sofware Proec Manageen Eigh IEEE/ACIS Inernaional Conference on Couer and Inforaion Science (9) Coyrigh c 5 SERSC 37

14 Inernaional Journal of Muliedia and Ubiquiou Engineering Vol No6 (5) Auhor Wan-Jiang HAN he wa born in HeiLongJiang rovince China 967 She received her Bachelor Degree in Couer Science fro Hei Long Jiang Univeriy in 989 and her Maer Degree in Auoaion fro Harbin Iniue of Technology in 99 She i an aian rofeor in School Of Sofware Engineering Beiing Univeriy of Po and Telecounicaion China Her echnical inere include ofware roec anageen and ofware roce iroveen Tian-Bo Lu he wa born in Guizhou Province China 977 He received hi Maer Degree in couer cience fro Wuhan Univeriy in 3 and hi PHD Degree in couer cience fro he Iniue of Couing Technology of he Chinee Acadey of Science in 6 He i an Aociae rofeor in School of Sofware Engineering Beiing Univeriy of Po and Telecounicaion China Hi echnical inere include inforaion and nework ecuriy rued ofware and PP couing Xiao-Yan Zhang he wa born in Shandong Province China 973 She received her Maer Degree in Couer Alicaion in 997 and her PHD Degree in Counicaion and inforaion ye fro Beiing Univeriy of Po and Telecounicaion China in She i an Aociae rofeor in School of Sofware Engineering Beiing Univeriy of Po and Telecounicaion Beiing China Her echnical inere include ofware eiaion and ofware roce iroveen 38 Coyrigh c 5 SERSC