.png){kind=icon}
返回
Complexity and approximation for scheduling problem for a torpedo
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2011.01.015.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers a special case of the coupled-tasks scheduling problem on monoprocessor. The general problems were analyzed in depth by Orman and Potts (1997). In this paper, we consider that all processing times are equal to 1, the gap has exact length L, we have precedence constraints, incompatibility constraints are introduced and the criterion is to minimize the scheduling length. We use this problem to study the problem of data acquisition and data treatment of a torpedo under the water. We show that this problem is NP-complete and we propose an rho-approximation algorithm where rho <= (L+6)/6 - 1/2(L+2) + (L+3)/6n(L+2). (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Coupled-tasks
Incompatibility constraints
Complexity
Approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
COMPUTER SIMULATIONS OF MULTIPLE ORGAN FAILURE SECONDARY TO SHOCK AND SEPSIS WITH A MULTI-TISSUE, ENDOTHELIAL-LEVEL AGENT BASED MODEL..png)
ShockOAAI
ShockIF0
OAAI分享收藏Characterization of a novel cellular retinoic acid/retinol binding protein from shrimp: expression of the recombinant protein for immunohistochemical detection and binding assayGene
GeneIF0
PREAI
分享收藏 没有更多内容
没有更多内容