.png){kind=icon}
返回
Scheduling problems with a learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(00)00175-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many realistic settings, the production facility (a machine, a worker) improves continuously as a result of repeating the same or similar activities; hence, the later a given product is scheduled in the sequence, the shorter its production time. This learning effect is investigated in the context of various scheduling problems. It is shown in several examples that although the optimal schedule may be very different from that of the classical version of the problem, and the computational effort becomes significantly greater, polynomial-time solutions still exist. In particular, we introduce polynomial solutions for the single-machine makespan minimization problem, and two for multi-criteria single-machine problems and the minimum flow-time problem on parallel identical machines. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
scheduling
single-machine
parallel machines
learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Third-order exceptional point and successive switching among three states in an optical microcavity光学微腔中三阶异常点和三个状态之间的连续切换
OAAI
OAAI分享收藏
没有更多内容
没有更多内容