18544.帶有學(xué)習(xí)及退化效應(yīng)的排序問題

1、碩士學(xué)位論文論文作者：學(xué)科專業(yè)：指導(dǎo)教師：培養(yǎng)單位：培養(yǎng)類別：完成時(shí)間：沈陽師范大學(xué)學(xué)位評(píng)定委員會(huì)單位代碼：單位代碼：10166帶有學(xué)習(xí)及退化效應(yīng)的排序問題帶有學(xué)習(xí)及退化效應(yīng)的排序問題胡晨晨運(yùn)籌學(xué)與控制論趙玉芳數(shù)學(xué)與系統(tǒng)科學(xué)學(xué)院全日制2015年5月22日SchedulingproblemswithlearningdeteriationeffectAbstractIndertosaveprocessingcostsnotallthejob

2、shavetobeprocessedintheindustrialproductionprocess.Somejobscanberejected.Fexamplethejobswhichneedalongprocessingtime.Theindustrycanpaytoprocessoutsidepurchase.Thejobscanberejectedbuthavetopaytheextrafeeswhichisthesocalle

3、drejectionpenalty.Atthesametimeduetowearingdownbreakingdownofthemachineitisdemedtomaintaintoimprovethespeedoftheprocessingtimeinacertaintime.Inmanyrealisticproblemsthejobsrequirepreheatinstallthenecessaryjigsfixturesbefe

4、processingthejobsneedtocooldownafterprocessingsuchasintheindustrialprocessesofsteelmetallurgy.Duringtheprocessofproductionthetimesalwayscontainthesetuptimedeliverytime.Thesetuptimedeliverytimeofthejobaffectadverselytoits

5、totalcompletiontime.Therefeitisnecessaryfustoconsiderthetimespentonsetupdeliveryofthejob.Thisthesisconsiderstheschedulingproblemswithlearningeffectdeteriationeffectsetuptimedeliverytimerejectionpenalty.Theobjectivesareto

6、minimizethemakespanthetotalcompletiontimesoon.Accdingtothedifferentconditionsoftheprocessingtimethethesisanalyzesthecomplexityofthealgithmsftheseproblemsrespectivelywhichshowstheproblemsaresolvableinpolynomialtime.Thespe

7、cificcontentsaresummarizedasfollows:1)Whenthejob’sprocessingtimeisijijiijpabt??thisthesisconsiderstheunrelatedparallelmachineschedulingwithdeteriatingjobsrejection.Theobjectivesaretominimizethesumoftheschedulingcriterion

8、oftheacceptedjobsthetotalpenaltyoftherejectedjobs.Theschedulingcriterionsarethetotalloadthetotalcompletiontimerespectively.Thepurposeistofindthesetofrejectedjobsthenonrejectedjobsarrangethenonrejectedjobssequencetominimi

9、zetheobjectivecosts.Theobjectivefunctionoftwoproblemscanbetransfmedintotheassignmentproblemwhichshowsthattheproblemsaresolvableinpolynomialtime.2)Whenthejob’sprocessingtimeis??[]jrjppgr?thisthesisconsidersthesinglemachin