首页> 美国卫生研究院文献>other >Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem
【2h】

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

机译:混合元启发式算法求解模糊单批处理机调度问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.
机译:本文提出了在存在模糊截止日期的情况下,在现实世界中的单批处理机器(SBPM)调度中使作业的总加权拖延时间最小化的问题。本文首先建立了模糊混合整数线性规划模型。然后,由于问题的复杂性(NP难点),我们利用遗传算法(GA),可变邻域搜索(VNS)和模拟退火的优势,设计了两种混合元启发式算法,称为GA-VNS和VNS-SA。 SA)框架。此外,我们提出了三种模糊最早到期日期启发式方法来解决给定的问题。通过针对几个随机测试问题的计算实验,对参数进行了稳健的校准。最后,给出了不同规模测试问题的计算结果,以比较所提出的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号