...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
【24h】

A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times

机译：具有准备时间的两主体单机调度问题的蜜蜂优化算法

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

摘要

In this paper we consider two agents that compete on the use of a common processor. Each of the agents has a set of jobs that have to be processed on the same machine without preemption. Each of the agents wants to minimize an objective function that depends on the completion time of its own jobs. In addition, each job has different release dates. In the presence of unequal release dates, it is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. The objective is to find a schedule that performs well with respect to the objectives of both agents. To solve this difficulty problem, we construct a branch-and-bound solution scheme incorporating these bounds and some dominance rules for the optimal solution. In view of the advantage of combining local and global searches in the honey-bees optimization algorithm, we attempt to use a marriage in honey-bees optimization algorithm (MBO) to find near-optimal solutions. We conduct extensive computational experiments to evaluate the performance of the algorithms.
机译：在本文中，我们考虑了两个使用通用处理器竞争的代理。每个代理都有一组作业，这些作业必须在同一台计算机上进行处理而不能抢占。每个代理都希望最小化取决于其自己工作完成时间的目标功能。此外，每个作业都有不同的发布日期。在发布日期不平等的情况下，形成一个非完整的批次有时是有利的，而在其他情况下，等待将来的工作到达以增加批次的填充是更好的策略。目的是找到一个在两个代理人的目标方面都表现良好的时间表。为了解决这个难题，我们构造了一个分支定界解方案，结合了这些界限和一些最优解的主导规则。考虑到在蜜蜂优化算法中组合本地搜索和全局搜索的优势，我们尝试在蜜蜂优化算法（MBO）中使用联结来找到接近最优的解决方案。我们进行了广泛的计算实验，以评估算法的性能。

著录项

  • 来源
    《Applied Mathematical Modelling》 |2015年第9期|2587-2601|共15页
  • 作者

    Yunqiang Yin; Wen-Hung Wu; T.C.E. Cheng; Chin-Chia Wu; Wen-Hsiang Wu;

  • 作者单位

    Faculty of Science, Kunming University of Science and Technology, Kunming 650093, China;

    Department of Business Administration, Kang-Ning Junior College, Taipei, Taiwan;

    Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;

    Department of Statistics, Feng Chia University, Taichung, Taiwan;

    Department of Healthcare Management, Yuanpei University of Medical Technology, Hsinchu, Taiwan;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Scheduling; Two agents; MBO algorithm;

    机译：排程;两名代理;MBO算法;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号