首页> 外文会议>Combinatorial optimization and applications >Bicriteria Scheduling on Single-Machine with Inventory Operations
【24h】

Bicriteria Scheduling on Single-Machine with Inventory Operations

机译:具有库存操作的单机双标准计划

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

摘要

In this paper, we consider the single machine scheduling problem with inventory operations. The objective is to minimize makespan subject to the constraint that the total number of tardy jobs is minimum. We show the problem is strongly NP-hard. A polynomial (1 + 1/(m - 1))-approximation scheme for the problem is presented, where m is defined as the total job's processing times ∑_(Pj) divided by the capacity c of the storage, and an optimal algorithm for a special case of the problem, in which each job is one unit in size, is provided.
机译:在本文中,我们考虑带有库存操作的单机调度问题。目的是在受制于迟到的工作总数最少的约束下,最小化制造期。我们证明问题是强烈的NP难题。提出了针对该问题的多项式(1 +1 /((m-1))-近似方案,其中m定义为总作业的处理时间∑_(Pj)除以存储容量c,并采用一种最佳算法针对该问题的特殊情况,其中每个作业的大小为一个单位。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号