.png){kind=icon}
返回
Parallel-machine scheduling with identical machine resource capacity limits and DeJong's learning effect
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2021.1902011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider parallel-machine scheduling with identical machine resource capacity limits and DeJong's learning effect. Each job has a resource consumption requirement and a normal processing time. The actual processing time of a job is a function of its normal processing time, subject to DeJong's learning effect, while the resource consumption of a job is a function of its actual processing time. Each machine has the same resource capacity limit. The objective is to maximise the minimum machine load. Considering three resource consumption functions, namely, linear, concave, and convex, we show that all three scheduling models are NP-hard and propose two approximation algorithms for the models and analyse their worst-case ratios.
Keyword:
Parallel machine
scheduling
resource consumption
machine resource capacity
DeJong’ s learning effect
approximation algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容