• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of advances in management research >The mean flow time in open shop scheduling
【24h】

The mean flow time in open shop scheduling

机译：开放式商店调度中的平均流量时间

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

摘要

Purpose-The purpose of this paper is to minimize the mean flow time in open shop scheduling problem (OSSP). The scheduling problems consist of n jobs and m machines, in which each job has O operations. The processing time for 50 OSSP was generated using a linear congruential random number. Design/methodology/approach - Different evolutionary algorithms are used to minimize the mean flow time of OSSP. This research study used simulated annealing (SA), Discrete Firefly Algorithm and a Hybrid Firefly Algorithm with SA. These methods are referred as A1, A2 and A3, respectively. Findings - A comparison of the results obtained from the three methods shows that the Hybrid Firefly Algorithm with SA (A3) gives the best mean flow time for 76 percent instances. Also, it has been observed that as the number of jobs increases, the chances of getting better results also increased. Among the first 25 problems (i.e. job ranging from 3 to 7), A3 gave the best results for 13 instances, Le., for 52 percent of the first 25 instances. While for the last 25 problems (i.e. Job ranging from 8 to 12), A3 gave the best results for all 25 instances, i.e. for 100 percent of the problems. Originality/value - From the literature it has been observed that no researchers have attempted to solve OOSPs using Firefly Algorithm (FA). In this research work an attempt has been made to apply the FA and its hybridization to solve OSSP. Also the research work carried out in this paper can also be applied for a real-time Industrial problem.
机译：目的 - 本文的目的是最大限度地减少开放式商店调度问题（OSSP）中的平均流量时间。调度问题由N个作业和M机器组成，其中每个作业都有O操作。使用线性总体随机数生成50个OSSP的处理时间。设计/方法/方法 - 不同的进化算法用于最小化OSSP的平均流量时间。该研究研究使用模拟退火（SA），离散萤火虫算法和SA混合萤火虫算法。这些方法分别称为A1，A2和A3。结果 - 从三种方法获得的结果的比较表明，具有SA（A3）的混合萤火虫算法给出了76％的实例的最佳平均流量。此外，已经观察到，随着工作的数量增加，获得更好结果的机会也增加了。在第一个25个问题中（即，从3到7的工作范围），A3给出了13个实例的最佳成果Le。，占前25个实例的52％。虽然在过去的25个问题（即，从8比12的工作范围内），A3为所有25个实例提供了最佳结果，即100％的问题。原创性/值 - 从文献中观察到，没有研究人员试图使用萤火虫算法（FA）来解决OOSP。在这项研究中，已经尝试了应用FA及其杂交来解决OSSP。此文中开展的研究工作也可用于实时工业问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号