碩士論文開題報(bào)告-資料下載頁
2025-06-28 16:11本頁面
【正文】 g. Artificial Intelligence Review, 鈀燭罰櫝箋礱颼畢韞糲銨鵬駱隸驅(qū)訛。13(2): 87127. [11] . Burke, . Jackson, . Kingston and . Weare, (1997). Automated Timetabling:愜執(zhí)緝蘿紳頎陽灣熗鍵艤訥贓棧馴嘆。The State of the Art, The Computer Journal, Vol. 40, No. 9, pp 565571. 貞廈給鏌綞牽鎮(zhèn)獵鎦龐朮戧籩賂馱見。[12] Carter, ., and G. Laporte, (1996). Recent Developments in Practical Examination嚌鯖級(jí)廚脹鑲銦礦毀蘄鷯鑭嶁盧馭勞。Timetabling. In Edmund Burke and Peter Ross, editors, The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 1153, 321. SpringerVerlag, Berlin. 薊鑌豎牘熒浹醬籬鈴騫違紗駑緩馬蝕。[13] Bardadym, ., (1996). ComputerAidedSchool and University Timetabling: The New 齡踐硯語蝸鑄轉(zhuǎn)絹攤濼絡(luò)減貽顏饌農(nóng)。Wave. In Edmund Burke and Peter Ross, editors, The Practice and Theory of Automated 紳藪瘡顴訝標(biāo)販繯轅賽憮賄豎毆饉蒞。Timetabling. Lecture Notes in Computer Science 1153, 2245. SpringerVerlag, Berlin. 飪籮獰屬諾釙誣苧徑凜騙橥峽軋饈俠。[14] Burke, ., Petrovic,S., (2002). Recent Research Directions in Automated Timetabling. 烴斃潛籬賢擔(dān)視蠶賁粵貫飭驢噦餾艱。European Journal of Operational Research (EJOR), Vol. 140, No. 2, pp. 266280. 鋝豈濤軌躍輪蒔講嫗鍵礪脈賁膚饃麗。[15] Ahuja, ., . Orlin and , (2000). Very Large Scale Neighbourhood Search. 擷偽氫鱧轍冪聹諛詼龐復(fù)堝窮馭餿職。International Transaction in Operational Research 7, 301317. 蹤飯夢(mèng)摻釣貞綾賁發(fā)蘄韃釓嶇淶饋麩。[16] Burke, ., Bykov,Y., Newall, J., Petrovic, S., (2004). A TimePredefined Local Search婭鑠機(jī)職銦夾簣軒蝕騫設(shè)猶饌還館縉。Approach to Exam Timetabling Problem. Accepted for Publication in IIE Transaction on 譽(yù)諶摻鉺錠試監(jiān)鄺儕瀉濰鴇貪堝餡鷥。Operations Engineering. [17] Carter, ., G. Laporte, and Lee, ., (1996). Examination Timetabling: Algorithmic儔聹執(zhí)償閏號(hào)燴鈿膽賾勞覡祕(mì)繭餛綾。Strategies and Applications. Journal of the Operation Research Society 74, 373383. 縝電悵淺靚蠐淺錒鵬凜錈惡層魎馀鯛。[18] Ahuja RK, Orlin JB and Sharma D (2001) Multiexchange Neighbourhood Search Algo驥擯幟褸饜兗椏長(zhǎng)絳粵藎鍰館煒餓紓。rithm for Capacitated Minimum Spanning Tree Problem. Mathematical Programming91, 癱噴導(dǎo)閽騁艷搗靨驄鍵檜簍貢釵餑鬢。7197. 6[19] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, (1993). Network Flows:鑣鴿奪圓鯢齙慫餞離龐東償禱對(duì)餅簣。Theory, Algorithms, and Applications. ISBN 1000499012, Prentice Hall, New 。[20] Caramia, M., , P., Italiano, ., (2001). New Algorithms for Examinations遜輸吳貝義鰈國(guó)鳩猶騸繢樣餃鱉饒禿。Timetabling. In Naher, S., Wagner, D., editors, Algorithm Engineering 4th Int. Workshop, 幘覘匱駭儺紅鹵齡鐮瀉戲穎譎琿餌飫。Proc. WAE 2000 (Saarbrucken, Germany, September. Lecture Notes in Computer Sci誦終決懷區(qū)馱倆側(cè)澩賾鱺罷礙鋮飴盜。ence, Vol. 1982, 230241. SpringerVerlag, BerlinHeidelbergNew York. 醫(yī)滌侶綃噲睞齒辦銩凜贗囂審慶飼頗。
黨政相關(guān)相關(guān)推薦
鄂ICP備17016276號(hào)-1