.png){kind=icon}
返回
Scheduling with processing set restrictions: A survey
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijpe.2008.09.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scheduling problems with processing set restrictions have been studied extensively by computer scientists and operations researchers under different names. These include 11 scheduling typed task systems multi-purpose machine scheduling scheduling with eligibility constraints scheduling with processing set restrictions, and semi-matchings for bipartite graphs. In this paper we survey the state of the art of these problems. Our survey covers offline and online problems, as well as nonpreemptive and preemptive scheduling environments. Our emphasis is on polynomial-time algorithms, complexity issues, and approximation schemes. While our main focus is on the makespan objective, other performance criteria are also discussed. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Parallel machines
Processing set restrictions
Computational complexity
Worst-case analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.1K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Surface-induced hypothermia: Effects on coronary blood flow autoregulation and vascular reserve
PREAI
分享收藏Cellular Prion Proteins of Mammalian Species Display an Intrinsic Partial Proteinase K Resistance
PREAI
分享收藏What's new in Histological Classification and Recognition of Naso-Pharyngeal Carcinoma (N.P.C.)
PREAI
分享收藏
查看更多内容