【24h】

Scheduling a cellular manufacturing system with GA

机译:用GA调度蜂窝制造系统

获取原文

摘要

The flexible manufacturing cell scheduling problem is considered with a multi-objective approach, pursuing together makespan minimisation and the in process job wait minimisation. The formulation of the scheduling problem is discussed, analysing how to generate well suited sequences, like generalised permutation sequences, and the proper construction of a JIT timing of activities. An evolutionary sequencing algorithm based on both classic genetic operators and hybrid operators is then proposed. The hybrid operators have been introduced to construct highly fit initial population, to perform periodically a local search on the population and to maintain enough genetical diversity in the actual population. Simulation runs on a large number of randomly generated problems, showed the high performance of the proposed evolutionary hybrid algorithm, in front of a modified NEH algorithm, in the determination of schedules minimising makespan and in process job wait together.
机译:柔性制造单元调度问题被认为是一种多目标方法,追求Mapspan最小化和过程作业等最小化。讨论了调度问题的制定,分析了如何生成良好的序列,如广义置换序列,以及适当的活动的JIT时机的结构。然后提出了一种基于经典遗传算子和混合算子的进化排序算法。已引入混合算子以构建高度拟合的初始群体,以定期对人口进行本地搜索,并在实际人群中保持足够的遗传多样性。模拟在大量随机产生的问题上运行,显示了所提出的进化混合算法的高性能,在修改的NEH算法前,在最小化MAPESPAN和过程作业等待着的时间表的确定中的确定。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号