.png){kind=icon}
返回
Several flow shop scheduling problems with truncated position-based learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.07.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The concept of truncated position-based learning process plays a key role in production environments. However, it is relatively unexplored in the flow shop setting. In this paper, we consider the flow shop scheduling with truncated position-based learning effect, i.e., the actual processing time of a job is a function of its position and a control parameter in a processing permutation. The objective is to minimize one of the six regtilar performance criteria, namely, the total completion time, the makespan, the total weighted completion time, the discounted total weighted completion time, the sum of the quadratic job completion times, and the maximum lateness. We present heuristic algorithms and analyze the worst-case bound of these heuristic algorithms. We also provide the computational results to evaluate the performance of the heuristics. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Learning effect
Regular performance criteria
Worst-case analysis
Flow shop
Heuristic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Lipid Droplet Accumulation Independently Predicts Poor Clinical Prognosis in High-Grade Serous Ovarian Carcinoma.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
PREAI
分享收藏分享收藏
查看更多内容