• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of management science and engineering management >A novel hybrid SA/GA algorithm for solving an integrated cell formation-job scheduling problem with sequence-dependent set-up times
【24h】

A novel hybrid SA/GA algorithm for solving an integrated cell formation-job scheduling problem with sequence-dependent set-up times

机译：一种新颖的SA / GA混合算法，用于解决与序列相关的建立时间的综合细胞形成作业调度问题

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

摘要

Cell formation problems attempt to assign machines and products to manufacturing cells so as to minimize inter-cell moves, in which some other aspects of the manufacturing system, such as time of order delivery, have been mostly neglected. To fill the gap, this paper addresses the cell formation problem and job scheduling simultaneously. To this end, a mixed integer nonlinear program is proposed to address issues related to both cell formation and job scheduling in a job shop layout. The proposed model minimizes the costs of operations and transportation in a single-period setting, since the problem considered is a strategic problem. Moreover, a hybrid simulated-annealing/genetic (SA/GA) algorithm is developed to cope with the complexity of the proposed model. Finally, numerical experiments are reported that validate the performance of the hybrid algorithm developed.
机译：单元形成问题试图将机器和产品分配给制造单元，以使单元间移动最小化，在该过程中，制造系统的其他一些方面（例如订单交付时间）已被大大忽略。为了填补这一空白，本文同时解决了单元格形成问题和作业调度问题。为此，提出了一种混合整数非线性程序，以解决与车间布局中的单元形成和作业调度有关的问题。由于所考虑的问题是战略性问题，因此所提出的模型将单周期设置中的运营和运输成本降至最低。此外，开发了一种混合的模拟退火/遗传（SA / GA）算法来应对所提出模型的复杂性。最后，报告了数值实验，验证了所开发的混合算法的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号