基于学习效应的单机调度总完工时间最小化问题-研究

基于学习效应的单机调度总完工时间最小化问题-研究

ID:31982665

大小:3.15 MB

页数:53页

时间:2019-01-30

基于学习效应的单机调度总完工时间最小化问题-研究_第1页
基于学习效应的单机调度总完工时间最小化问题-研究_第2页
基于学习效应的单机调度总完工时间最小化问题-研究_第3页
基于学习效应的单机调度总完工时间最小化问题-研究_第4页
基于学习效应的单机调度总完工时间最小化问题-研究_第5页
资源描述:

《基于学习效应的单机调度总完工时间最小化问题-研究》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、万方数据AbstractABSTRACTThelearningactivitieswillhaveasignificantinfluenceonproductionprocessingiftherehasaninvolvementofhumansinschedulingenvironments.Hence,itismorereasonabletotakethelearningeffectsintoconsiderationonsomeproductionschedulingproblem.Ontheothe

2、rhand,thereleasetimes,playsanimportantroleindevelopingproductionplan,hasacloserelationshipwiththeefficiencyoftheentireproductionactivities.Forexample,jobsCanbeformabatchtobeprocessingsimultaneouslyinWaferfabrication埘t11thepresenceofunequalreleasetime.Itiss

3、ometimesadvantageoustoformanon-fullbatchduetospeciallongwaitingtime,whileinothersituationsitisabetterstrategytowaitforfuturejobarrivalsinordertoincreasethefullnessofthebatch.Therefore,ithastheoreticalandpracticalsignificancetotakebothlearningeffectandunequ

4、alreleasetimeintoconsiderationinsomeschedulingproduction.However,research、析Ⅱ1learningandreadytimesislimited.whicheitherbasedonposition-dependentorsuln—of-normal-timedependentlearningeffect.Motivatedbythis,inthispaper,asinglemachineschedulingproblem谢也actual

5、time·dependentlearningeffectandunequalreleasetimeconsiderationisinvestigatedwheretheobjectiveistominimizethetotalcompletiontime.Firstly,anonlinearintegerprogrammingmodelisformulatedforthisproblem,whichwillbeusedtoobtainthesolutionsforsmallsizeproblemsthrou

6、ghtheILOGCPsoftware.Then,twodominancerulesaredevelopedbypairwiseinterchangetechnique.Thenabranch—and-bound(B&B)algorithmincorporatingwithtwodominancepropertiesandtwolowerboundsisdevelopedtoobtainsolutionsforsmallsizeproblems.Finally,ahybridparticleswarmopt

7、imization(HPSO)algorithmcombinedwitllthedominancerules.geneticoperatorsandsimulatedannealingalgorithmisproposedsincethisproblemisNP—hard.Inordertoexamtheperformanceoftheproposedbranch·-and·-boundalgorithmandhybridparticleswarlrloptimizationalgorithm,twoexp

8、erimentsaredevelopedbasedonthejobsize.Thefirstexperimentalresultsdemonstratethattheproposedbranch—and-boundalgorithmhasabetterperformancethanCPinsmallsizeproblems.TheHPSOalgorithmsCanevenobtainoptimalsolution

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。