24049.帶有交貨期的單機(jī)排序問(wèn)題

1、編號(hào)：碩士學(xué)位論文碩士學(xué)位論文題目：帶有交貨期的單機(jī)排序問(wèn)題培養(yǎng)單位：數(shù)學(xué)與系統(tǒng)科學(xué)學(xué)院專(zhuān)業(yè)名稱(chēng)：運(yùn)籌學(xué)與控制論指導(dǎo)教師：趙傳立教授研究生：范雁鵬完成時(shí)間：2014年5月21日沈陽(yáng)師范大學(xué)研究生處制類(lèi)別全日制研究生√教育碩士同等學(xué)力SinglemachineschedulingproblemwithduedateassignmentAbstractSchedulingproblemisakindofveryimptantcombinat

2、ialoptimizationproblems.Wediscusssomesinglemachineschedulingproblemswithduedatesassignmentinthispaperthecontexisasfollowing:Thefirstchaptermainlyintroducessomebackgroundknowledgesoftheschedulingproblemstheresearchstatust

3、hemainresearchcontentofthispaper.Thesecondchapterconsidersthesinglemachineschedulingproblemswithduedatesinwhichthejobshavecontrollableprocessingtimestheobjectionistominimizethetotalcostconcludingearlinesstardinessduedate

4、sresourceconsumption.Wedeterminetheoptimalresourceallocationbyusingthepropertiesoftheoptimalsequencewecombinetheeffectsoflearningwithcontrollableprocessingtimesprocessingtimeisalinearresourcefunctionconvexresourcefunctio

5、nweshowthattheproblemcanbesolvedinpolynomialtime.Thethirdchapterconsidersthemultiplecommonduedatesassignmentsinglemachineschedulingwithadeteriatingmaintenanceactivity.Themaintenancedurationisalinearfunctionaboutitsstarti

6、ngtimetheobjectiveistofindtheoptimalduedatestheoptimalmaintenancepositiontheoptimaljobsequencewedesignapolynomialtimealgithmdiscussthespecialcaseoftheproblem.Thefourthchapterintroducesthesinglemachineschedulingproblemswi

7、thmultiplecommonduedatesweproveseveralimptantpropertiestheobjectivefunctionincludeearlinesstardinessthethesizesofduedatesstartingtimeofduedateswegiveanefficientalgithmanalyzethecomputationalcomplexityofthisalgithm.Thelas