.png){kind=icon}
返回
Scheduling on parallel processors with varying processing times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.12.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we construct the pseudopolynomial dynamic programming algorithm that optimally solves the parallel identical processor scheduling problem to minimize the maximum job completion times (makespan) under varying processing times. They can be described by an arbitrary monotonic function dependent on the number of previously processed jobs, which can model learning or aging effects. Beside the canonical dynamic programming algorithm, we provide its efficient parallel fast version, which solves moderate problem instances of the problem within reasonable time and memory usage. Additionally, on the basis of the constructed algorithm, a fully polynomial time approximation scheme for the considered problem is provided. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Parallel processors
Learning effect
Aging effect
Dynamic programming
FPTAS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect具有DeJong学习效果的并行机调度的精确启发式算法
PREAI
分享收藏Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities具有老化效应和多维护活动的不相关并行机调度
PREAI
分享收藏A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect
PREAI
分享收藏分享收藏
查看更多内容