...
首页> 外文期刊>International Journal of Production Research >An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
【24h】

An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

机译:具有模糊处理时间的柔性作业车间调度问题的有效离散和谐搜索算法

获取原文
获取原文并翻译 | 示例
           

摘要

This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) algorithm is proposed for FJSP with fuzzy processing time. The objective is to minimise maximum fuzzy completion time. A simple and effective heuristic rule is proposed to initialise harmony population. Extensive computational experiments are carried out using five benchmark cases with eight instances from remanufacturing. The proposed heuristic rule is evaluated using five benchmark cases. The proposed DHS algorithm is compared to six metaheuristics. The results and comparisons show the effectiveness and efficiency of DHS for solving FJSP with fuzzy processing time.
机译:该研究解决了具有模糊处理时间的柔性作业车间调度问题(FJSP)。处理时间的模糊或不确定性是再制造的七个特征之一。提出了一种模糊处理时间的FJSP离散和谐搜索算法。目的是最小化最大模糊完成时间。提出了一种简单有效的启发式规则来初始化和谐种群。使用五个基准案例以及来自再制造的八个实例进行了广泛的计算实验。建议的启发式规则使用五个基准案例进行评估。将提出的DHS算法与六种启发式算法进行了比较。结果和比较表明,DHS在模糊处理时间下解决FJSP的有效性和效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号