A note on the time complexity of machine scheduling with DeJong's learning effect.

Computers & Industrial Engineering(2017)

引用 8|浏览16
暂无评分
摘要
•This note improves time complexity of two FPTASes provided in two papers published in CAIE.•Further general comments are also proposed in the last.
更多
查看译文
关键词
Scheduling,DeJong’s learning effect,FPTAS,Time complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要