.png){kind=icon}
返回
Machine scheduling with DeJong's learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2014.12.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a relatively new learning model in scheduling based on DeJong's learning effect. Compared with the classical learning model for scheduling, this model is more general and realistic. The objectives are to minimize makespan and total completion time. For the single-machine case, we show that both of the objectives are polynomially solvable. For the parallel-machine case, we show that minimizing total completion time is still polynomially solvable, while minimizing makespan is NP-hard, for which we provide a fully polynomial-time approximation scheme (FPTAS). (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
DeJong's learning effect
Makespan
Total completion time
FPTAS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect具有DeJong学习效果的并行机调度的精确启发式算法
PREAI
分享收藏Exploring state-level variabilities between perceived community resilience and posttraumatic stress symptoms during the COVID-19 pandemic: Multilevel modeling approach..png)
Traumatology
TraumatologyIF0
PREAI
分享收藏
分享收藏Asking about trauma: the experiences of psychological therapists in early intervention servicesPsychosis
PsychosisIF0
PREAI
分享收藏
查看更多内容