首页> 外文会议>Engineering Design Conference >A computational approach to imprecise jobshop scheduling using a genetic algorithm
【24h】

A computational approach to imprecise jobshop scheduling using a genetic algorithm

机译:使用遗传算法来确定jobshop调度的计算方法

获取原文

摘要

The scheduling of large made-to-order products is a difficult and potentially costly exercise. Schedules are currently prepared using precise time intervals for processes, yet this approach rarely reflects reality. This paper combines a fuzzy scheduler which incorporates imprecise durations with a Multi-Criteria Genetic Algorithm (MCGA) to counter this problem. The resulting application was applied to an industrial problem (the production of a pressure hull for a submarine) for testing. Further investigation into schedule robustness shows that improvements can be made by optimising pessimistic duration times in contrast to the common practice of using optimistic times.
机译:大型秩序产品的调度是一种难以且可能的昂贵的运动。目前使用精确的时间间隔来制备时间表,但这种方法很少反映现实。本文结合了模糊调度器,它与多标准遗传算法(MCGA)结合了不精确的持续时间来对策。得到的申请被应用于工业问题(潜艇的压力船体的生产)进行测试。进一步调查安排鲁棒性表明,可以通过与使用乐观时间的常见做法优化悲观的持续时间时间来进行改进。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号