• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IFAC PapersOnLine >A fuzzy ant colony optimization to solve an open shop scheduling problem with multi-skills resource constraints
【24h】

A fuzzy ant colony optimization to solve an open shop scheduling problem with multi-skills resource constraints

机译：一种模糊蚁群优化算法，解决具有多种技能资源约束的开店调度问题

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

An open shop scheduling problem based on a mechanical workshop is described here. The main objective is to find the sequence of jobs which minimizes the total flow time. For that reason, we first formulate the problem as a mixed integer linear programming model which considers different resource constraints related to the personnel assignment. Resource skills and their availability are required to process tasks. A mathematical model is described and solved optimally. Besides that, a fuzzy ant colony optimization method is proposed due to the difficulty to fix the different parameters of an ACO and improve the quality of the solution. Finally, some computational experiments are defined using the references of the literature to get efficiency of ant colony optimisation. A first kind of tests are related to the small-sized instances allowing to evaluate the general performance of the model and the algorithm while a second one involves the large-size instances showing a further evaluation of the algorithm.
机译：这里描述了基于机械车间的开放车间调度问题。主要目的是找到可以减少总流动时间的作业顺序。因此，我们首先将该问题表述为混合整数线性规划模型，该模型考虑与人员分配有关的不同资源约束。处理任务需要资源技能及其可用性。描述并优化了数学模型。除此之外，由于难以确定ACO的不同参数并提高求解质量，提出了一种模糊蚁群优化方法。最后，利用文献参考定义了一些计算实验，以获得蚁群优化的效率。第一种测试与小型实例相关，可以评估模型和算法的总体性能，而第二种测试涉及大型实例，这些实例显示了对算法的进一步评估。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号