.png){kind=icon}
返回
Single machine scheduling problems with exponentially time-dependent learning effects
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmsy.2014.11.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce a single-machine scheduling problem with an exponentially time-dependent learning effect. The processing time of a job is assumed to be an exponential function of the total normal processing time of jobs already processed before it. For such a scheduling problem, we first provide the upper bound for the maximum lateness and for the total weighted completion time. Next, we show that problems with the following criteria: makespan, the total completion time, the total weighted completion time, the total earliness/tardiness penalties and the maximum lateness under some agreeable conditions, are polynomially solvable. (C) 2014 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Time-dependent
Learning effect
Upper bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
14.2
论文数:
2.7K
被引数:
1.6W
机构
引用论文
Asking about trauma: the experiences of psychological therapists in early intervention services.png)
Psychosis
PsychosisIF0
PREAI
分享收藏Hope for Help-Seeking: A Positive Psychology Perspective of Psychological Help-Seeking Intentions
PREAI
分享收藏分享收藏
查看更多内容