• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Distributed scheduling of manufacturing systems with alternate routing and objectives based on completion time.
【24h】

Distributed scheduling of manufacturing systems with alternate routing and objectives based on completion time.

机译：具有基于完成时间的备用工艺路线和目标的制造系统的分布式计划。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The problem of developing a dynamic scheduler, based on the principles of distributed control of manufacturing systems is considered in this research. The domain of this research is the scheduling of jobs in a shop floor environment to optimize a given regular or non-regular performance measure. In this environment, the arrival of jobs is not known a priori, jobs have several alternatives for processing, machines can be added or removed from the system and the machines are considered to be unreliable.; A generic mathematical model that accommodates an objective based on completion time is developed for the scheduling problem. The problem is decomposed into independent sub-problems based on jobs. These sub-problems are categorized into independent agents and they are used in the construction of an agent-based scheduler. The agents schedule jobs by optimizing their local objectives, which in turn are used to optimize the global objective in an iterative manner.; Shop floor dynamics such as machine failures are incorporated into the agent based scheduler by assuming probabilistic machine failure rates and Markovian process. The failure rate equations are used in determining the new time estimates to process a ready job on an idle unreliable machine.; The agent-based scheduler is tested using some known problems from the literature and randomly generated problems of varying dimensions. A duality gap of 4% to 17% is observed on problems with known solutions. When compared with the best solution obtained by using different dispatching rules an improvement of 20% to 32% is obtained.
机译：本研究考虑了基于制造系统的分布式控制原理开发动态调度程序的问题。该研究的领域是在车间环境中调度作业，以优化给定的常规或非常规性能指标。在这种环境下，作业的到达不是先验的，作业具有多种处理选择，可以在系统中添加或删除机器，并且认为机器不可靠。针对调度问题，开发了一种基于完成时间来适应目标的通用数学模型。该问题被分解为基于作业的独立子问题。这些子问题被分类为独立的代理，它们被用于构建基于代理的调度程序。代理通过优化其本地目标来计划作业，而这些目标又被用于以迭代方式优化全局目标。通过假设概率机器故障率和马尔可夫过程，将车间动态（例如机器故障）并入基于代理的调度程序中。故障率方程式用于确定新的时间估计，以在空闲的不可靠机器上处理就绪的作业。使用文献中的一些已知问题和随机生成的尺寸变化问题来测试基于代理的调度程序。在已知解决方案的问题上，观察到4％到17％的对偶差距。与使用不同调度规则获得的最佳解决方案进行比较时，可将效率提高20％至32％。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号