.png){kind=icon}
返回
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.02.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we analyze the two-machine flowshop problem with the makespan minimization and the learning effect, which computational complexity was not determined yet. First, we show that an optimal solution of this problem does not have to be the 'permutation' schedule if the learning effect is taken into consideration. Furthermore, it is proved that the permutation and non-permutation versions of this problem are NP-hard even if the learning effect, in a form of a step learning curve, characterizes only one machine. However, if both machines have learning ability and the learning curves are stepwise then the permutation version of this problem is strongly NP-hard. Furthermore, we prove the makespan minimization problem in m-machine permutation proportional flowshop environment remains polynomially solvable with identical job processing times on each machine even if they are described by arbitrary functions (learning curves) dependent on a job position in a sequence. Finally, approximation algorithms for the general problem are proposed and analyzed. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Learning effect
Flowshop
Computational complexity
Polynomial algorithm
Heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect具有DeJong学习效果的并行机调度的精确启发式算法
PREAI
分享收藏Lipid Droplet Accumulation Independently Predicts Poor Clinical Prognosis in High-Grade Serous Ovarian Carcinoma.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏Scheduling problems with deteriorating jobs and learning effects including proportional setup times
PREAI
分享收藏
查看更多内容