.png){kind=icon}
返回
Some single-machine scheduling problems with a truncation learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.01.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called sum-of processing-times-based learning in which the actual processing time of a job is a non-increasing function of the jobs already processed. However, the actual processing time of a given job drops to zero precipitously when the normal job processing times are large. Motivated by this observation, we propose a truncation learning model where the actual job processing time is a function which depends not only on the processing times of the jobs already processed but also on a control parameter. The use of the truncated function is to model the phenomenon that the learning of a human activity is limited. Under the proposed learning model, we show that some single-machine scheduling problems can be solved in polynomial time. In addition, we further provide the worst-case error bounds for the problems to minimize the maximum lateness and total weighted completion time. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Single-machine
Truncation learning effect
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect具有DeJong学习效果的并行机调度的精确启发式算法
PREAI
分享收藏Scheduling problems with deteriorating jobs and learning effects including proportional setup times
PREAI
分享收藏
查看更多内容