Job Shop Scheduling英文学习资料

Job Shop Scheduling英文学习资料

ID:38816691

大小:204.48 KB

页数:27页

时间:2019-06-19

Job Shop Scheduling英文学习资料_第1页
Job Shop Scheduling英文学习资料_第2页
Job Shop Scheduling英文学习资料_第3页
Job Shop Scheduling英文学习资料_第4页
Job Shop Scheduling英文学习资料_第5页
资源描述:

《Job Shop Scheduling英文学习资料》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Chapter7:Job-shopscheduling(pp.134–160)GeneticalgorithmsinengineeringsystemsEditedbyA.M.S.ZalzalaandP.J.FlemingIEEcontrolengineeringseries55c1997:TheInstitutionofElectricalEngineers,ISBN:0852969023Chapter7Job-shopschedulingTakeshiYamadaandRyoheiNakano7.1IntroductionScheduli

2、ngistheallocationofsharedresourcesovertimetocompetingactivities.Ithasbeenthesubjectofasignificantamountofliteratureintheoperationsresearchfield.Emphasishasbeenoninvestigatingmachineschedulingproblemswherejobsrepresentactivitiesandmachinesrepresentresources;eachmachinecanproce

3、ssatmostonejobatatime.Table7.1:A33problemjobOperationsrouting(processingtime)11(3)2(3)3(3)21(2)3(3)2(4)32(3)1(2)3(1)Thenmminimum-makespangeneraljob-shopschedulingproblem,hereafterreferredtoastheJSSP,canbedescribedbyasetofnjobsfJig1jnwhichistobeprocessedonasetofmmachines

4、fMrg1rm.Eachjobhasatechnologicalsequenceofmachinestobeprocessed.TheprocessingofjobJjonmachineMriscalledtheoperationOjr.OperationOjrrequirestheexclusiveuseofMrforanuninterrupteddurationpjr,itsprocessingtime.Ascheduleisasetofcompletiontimesforeachoperationfcjrg1jn;1rmth

5、atsatisfiesthoseconstraints.ThetimerequiredtocompleteallthejobsiscalledthemakespanL.Theobjectivewhensolvingoroptimizingthisgeneralproblemistodeterminetheschedulewhichmin-imizesL.Anexampleofa33JSSPisgiveninTable7.1.Thedataincludesthe1CHAPTER7.JOB-SHOPSCHEDULING2routingofeach

6、jobthrougheachmachineandtheprocessingtimeforeachoperation(inparentheses).TheGantt-ChartisaconvenientwayofvisuallyrepresentingasolutionoftheJSSP.Anexampleofasolutionforthe33probleminTable7.1isgiveninFigure7.1.,,,,M,,1J1J2J3,,,,,,,,JJJM,,,,23,,12,,,,,,,,,,,,,,MJJ,J3213,,,,,,

7、,,,,024681012time,,,Figure7.1:AGantt-Chartrepresentationofasolutionfora33problemTheJSSPisnotonlyNP-hard,butitisoneoftheworstmembersintheclass.Anindicationofthisisgivenbythefactthatone1010problemformulatedbyMuthandThompson[18]remainedunsolvedforover20years.Besidesexhaustiv

8、esearchalgorithmsbasedonbranchandboundmethods,sev-eralapproximationalgorithmshaveb

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

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

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