.png){kind=icon}
返回
Single-machine scheduling with learning considerations
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00246-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The focus of this work is to analyze learning in single-machine scheduling problems. It is surprising that the well-known learning effect has never been considered in connection with scheduling problems. It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
scheduling
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分享收藏Due-date assignment and single machine scheduling with compressible processing times具有可压缩处理时间的到期日分配和单机调度
PREAI
分享收藏
查看更多内容