Dynamic Schedule Management Lessons from the Air 动态调度管理的经验教训，从空气.pptVIP

下载本文档

4
0
约9.84千字
约 61页
2018-06-24 发布于四川
举报
版权申诉

Dynamic Schedule Management Lessons from the Air 动态调度管理的经验教训，从空气.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Dynamic Schedule Management Lessons from the Air 动态调度管理的经验教训，从空气

27th Nov 2001 Univ. Nebraska Constraint Based Scheduling and Optimization: From Research to Application Brian Drabble Computational Intelligence Research Laboratory drabble@ On Time Systems, Inc Overview Constraint based scheduling Algorithms LDS and Schedule Pack Squeaky Wheel Optimization Applications Aircraft assembly Ship construction Future Directions Summary Constraint Based Scheduling Problem characteristics Search based techniques Problem Characteristics Task details: resource requirements deadlines/release times value Problem Characteristics Task details Resource characteristics: type capacity availability speed, etc. Problem Characteristics Problem Characteristics Constraints: setup costs exclusions reserve capacity union rules/business rules Problem Characteristics Constraints Optimization criteria: makespan, lateness, cost, throughput Optimization Techniques Operations Research (OR) LP/IP solvers seem to be near the limits of their potential Artificial Intelligence (AI) search-based solvers performance increasing dramatically surpassing OR techniques for many problems Search-based Techniques Systematic explore all possibilities Depth-First Search Limited Discrepancy Search Nonsystematic explore only “promising” possibilities WalkSAT Schedule Packing Heuristic Search A heuristic prefers some choices over others Search explores heuristically preferred options Limited Discrepancy Search Better model of how heuristic search fails Limited Discrepancy Search LDS-n deviates from heuristic exactly n times on path from root to leaf Schedule Packing Post-processing to exploit opportunities Schedule Packing schedule longest chains first starting from right Schedule Packing repeat, starting from the left Squeaky Wheel Optimization Key insight: scheduling involves two major decisions: which task to assign next where to assign it in the schedule Create a dual search space priority space schedule space Priority Space Architecture Construct Analyze Prioritize