A note on 'fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'

Kianfar K.; Moslehi G.

首页> 外文期刊>Discrete Applied Mathematics >A note on 'fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'

【24h】

A note on 'fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'

机译：关于“具有共同到期日的总加权拖延最小化的完全多项式时间近似方案”的注释

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this note, through a counter-example we show that the results in a recent paper (Kacem, 2010) [1] are incorrect. Since the proposed dynamic programming in Kacem (2010) [1] fails to optimally solve the problem in some instances, the designed FPTAS with O(n~2/ε) complexity is wrong. Then, we provide a modified FPTAS of O(n~3/ε) time complexity for the considered problem.

机译：在本说明中，通过一个反例，我们证明了最近一篇论文中的结果（Kacem，2010）[1]是不正确的。由于在某些情况下，Kacem（2010）[1]中提出的动态规划无法最佳地解决问题，因此设计的O（n〜2 /ε）复杂性FPTAS是错误的。然后，针对所考虑的问题，我们提供了O（n〜3 /ε）时间复杂度的改进FPTAS。

著录项

来源
《Discrete Applied Mathematics》 |2013年第14期|共2页
作者
Kianfar K.; Moslehi G.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学;
关键词
Approximation; Common due date; FPTAS; Scheduling; Tardiness;

机译：近似值;公共截止日期;FPTAS;计划;拖延;

相似文献

外文文献
中文文献
专利

1. A note on "fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date" [J] . Kianfar K., Moslehi G. Discrete Applied Mathematics . 2013,第13a14期

机译：关于“具有共同到期日的总加权拖延最小化的完全多项式时间近似方案”的注释
2. A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date [J] . Hans Kellerer, Vitaly A. Strusevich Theoretical computer science . 2006,第1a3期

机译：具有共同到期日的单机加权总延误问题的完全多项式逼近方案
3. Polynomial-Time Approximation Scheme for Concurrent Open Shop Scheduling with a Fixed Number of Machines to Minimize the Total Weighted Completion Time [J] . T.C. Edwin Cheng, Qingqin Nong, Chi To Ng Naval Research Logistics . 2011,第8期

机译：固定数量机器的并行开店调度的多项式时间近似方案，以使总加权完成时间最小化
4. FULLY POLYNOMIAL TIME APPROXIMATION SCHEME FOR TOTAL WEIGHTED TARDINESS MINIMIZATION UNDER A COMMON DUE DATE [C] . Imed Kacem 第38届国际计算机与工业工程大会（The 38th International Conference on Computers Industrial Engineering）论文集 . 2008

机译：常见到期日下加权加权最小化的完全多项式时间逼近方案
5. Heuristic Algorithm to Minimize Total Weighted Tardiness on the Unrelated Parallel Machine With Sequence Dependent Setup and Future Ready Time [D] . Li, Tzu Yi 2018

机译：具有序列相关设置和未来准备时间的启发式算法，最小化无关并行机上的总加权拖尾率
6. Order Batching in Warehouses by Minimizing Total Tardiness: A Hybrid Approach of Weighted Association Rule Mining and Genetic Algorithms [O] . Amir Hossein Azadnia, Shahrooz Taheri, Pezhman Ghadimi, 2013

机译：通过最大程度地减少总拖延来进行仓库中的订单批处理：加权关联规则挖掘和遗传算法的混合方法
7. Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date [O] . Kacem Imed 2010

机译：具有共同到期日的总加权拖延最小化的完全多项式时间近似方案

A note on 'fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'

摘要

著录项

相似文献

相关主题

期刊订阅