.png){kind=icon}
返回
Shared multi-processor scheduling
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2017.03.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job's completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized schedules that complete each job at the same time on its private and shared processor, if any is actually used by the job, include optimal schedules. We prove that the problem is NP-hard in the strong sense for jobs with arbitrary weights, and we give an efficient, polynomial-time algorithm for the problem with equal weights. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Divisible jobs
Shared processors
Subcontracting
Supply chains
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Ground-state degeneracy of Potts antiferromagnets on two-dimensional lattices: Approach using infinite cyclic strip graphs二维晶格上Potts反铁磁体的基态简并：基于无限循环带状图的求解方法OAAI
.png){kind=icon}
OAAI分享收藏Impact of vitamin D deficiency in relation to the clinical outcomes of hospitalized COVID-19 patients维生素D缺乏与住院COVID-19患者临床结局的关系影响
OAAI
OAAI分享收藏 没有更多内容
没有更多内容