機(jī)器帶準(zhǔn)備時(shí)間的分批排序問題研究.pdf

1、曲阜師范大學(xué)碩士學(xué)位論文機(jī)器帶準(zhǔn)備時(shí)間的分批排序問題研究姓名：孫志慧申請(qǐng)學(xué)位級(jí)別：碩士專業(yè)：數(shù)學(xué)、運(yùn)籌學(xué)與控制論指導(dǎo)教師：張玉忠20070401曲阜師范大學(xué)碩士學(xué)位論文B尉rCHSCHEDULINGWITHNoNSIMUI壓lANEoUSMACHINEAVAILABLETIMEABSTRACTSchedulingproblemisanimportantresearchfieldDuetoitsprofoundsignificancein

2、bothrealworldandtheoryschedulinghasalwaysbeenahottesttopicintheresearchofcombinatorialoptimizationsincethe1990sBatchschedul—ingandschedulingwithnonsimultaneousmachineavailabletimearerelativelynewschedulingmodels，whichare

3、attractingmoreandmoreattentionrecentlyInthisdissertation，manynewresultsaboutbatheschedulingwithinfiniteandnon—simultaneousmachineavailabletimetominimizemakespan(Gw)andtotalweightedcompletiontime(∑嶼0)arepresentedThreemain

4、ehapersareincludedasfollows：Inthefirstchapter，somenotations，definitionsandbasicbackgroundinfo卜mationaboutthesubjectareintroducedInthesecondchapter，wepresentanoverallsurveyonschedulingTheproblemsofschedulingjobswithnon—si

5、multaneousmachineavailabletimeonparallelidenticalanduniformbatchprocemingmachinestomininfizethemakespanuareconsideredOurmainresultsasfollows：Usedduplicatedalgorithm，twoheuristicalgorithttmAandA，aredesignedwhenthemachines

6、’capacityarefiniteandtheprovesthattheirperformanceratiosarenotmorethan(2一吉)【；(；)‘】and；(2一吉)areprovedlaterInchapter3，weconsideredtheproblemofminimizingthetotalweightedcompletedtimeonbatchschedulingwithnon—simultaneousmach