.png){kind=icon}
返回
Demonstrating Johnson's algorithm via resource-constrained scheduling
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2017.1314040.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The celebrated Johnson's algorithm to solve the two-machine flowshop scheduling problem to minimise the makespan plays a prominent role in scheduling research. In using resource-constrained scheduling to interpret Johnson's algorithm in teaching scheduling theory and operations management, we have received positive student feedback on the perceived intuition. We demonstrate this idea and show that the resource-constrained scheduling concept also helps simplify the proofs of some classical scheduling results.
Keyword:
scheduling
flowshop
makespan
relocation problem
resource constraint
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
Researcher Choices for Infant Sleep Assessment: Parent Report, Actigraphy, and a Novel Video System
PREAI
分享收藏
High-order derivative spectrophotometric determination of uranium in a cationic micellar medium.png)
The Analyst
The AnalystIF0
PREAI
分享收藏 没有更多内容
没有更多内容