原创力文档- 1、本文档共34页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
CS102
AlgorithmicFoundationsAndProblemSolving
DynamicProgrammingDrWenjinLuDepartmentofComputerScienceAcknowledgment:TheslidesareadaptedfromonesbyDr.PrudenceWong1
Dynamicprogramming
anefficientwaytoimplementsomedivideandconqueralgorithms2
LearningesUnderstandthebasicideaofdynamicprogrammingAbletoapplydynamicprogrammingtocomputeFibonaccinumbersAbletoapplydynamicprogrammingtosolvetheassemblylineschedulingproblem3
Assemblylinescheduling…4
ai,j:assemblytimeatSi,jti,j:transfertimeafterSi,jAssemblylineschedulinga1,1a1,2a1,3a1,4a1,n-1a1,na2,1a2,2a2,3a2,4a2,n-1a2,nstartendLine1Line22assemblylines,eachwithnstations(Si,j:lineistationj)S1,jandS2,jperformsametaskbuttimetakenisdifferentS1,1S1,2S1,3S1,4S1,n-1S1,nS2,1S2,2S2,3S2,4S2,n-1S2,nProblem:Todeterminewhichstationstogoinordertominimizethetotaltimethroughthenstationst1,1t1,2t1,3t1,n-1t2,1t2,2t2,3t2,n-1
Example(1)559415437startendLine1Line2S2,1S2,2S2,3S21,1S1,2S1,3S1,4 S1,1 S1,2 S2,3 S2,4 5 5 4 3 7 =24stationschosen:timerequired:
Example(2)559415437startendLine1Line2S2,1S2,2S2,3S2,42111S1,1S1,2S1,3S1,4 S1,1 S1,2 S2,3 S2,4 5 5 4 3 7 =24stationschosen:timerequired: S2,1 S1,2 S2,3 S1,4 15 1 5 4 3 2 4 =34stationschosen:timerequired:412
Example559415437startendLine1Line2S2,1S2,2S2,3S21,1S1,2S1,3S1,4 S1,1 S1,2 S2,3 S2,4 5 5 4 3 7 =24stationschosen:timerequired: S2,1 S1,2 S2,3 S1,4 15 1 5 4 3 2 4 =34stationschosen:timerequired:Howtodeterminethebeststationstogo?Therearealtogether2nchoicesofstations.Shouldwetrythemall?
Goodnews:DynamicProgrammingWedon’tneedtotryallpossiblechoices.Wecanmakeuseofdynamicprogramming:Ifwecancomputethefastestwaystogetthro’stationS1,nandS2,n,thenthefasterofthesetwowaysistheoverallfastestway.Tocomputethefastestwaystogetthro’S1,n(similarlyforS2,n),weneedtoknowthefastestwaytogetthr
文档评论（0）