首页> 外文会议>Algorithms and Computation >A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags
【24h】

A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags

机译:具有时滞的两机Flowshop调度问题的一种更好的逼近

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

摘要

In this paper we consider the two-machine flowshop scheduling problem with time lags. The problem has been known to be strongly NP-hard and 2-approximation algorithms have been obtained. We give a (11/6)-approximation algorithm that runs in O(n log n) time for an instance with n jobs.
机译:本文考虑带时滞的两机流水车间调度问题。已知该问题是强烈的NP困难的,并且已经获得了2-近似算法。对于具有n个作业的实例,我们给出了一种(11/6)近似算法,该算法在O(n log n)时间内运行。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号