.png){kind=icon}
返回
Two-machine flowshop scheduling problem with coupled-operations
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-018-2967-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses a generalization of the coupled-operations scheduling problem in the context of a flow shop environment. We consider the two-machine scheduling problem with the objective of minimizing the makespan. Each job consists of a coupled-operation to be processed first on the first machine and a single operation to be then processed on the second machine. A coupled-operation contains two operations separated by an exact time delay. The single operation can start on the second machine only when the coupled-operation on the first machine is completed. We prove the NP-completeness of two restricted versions of the general problem, whereas we also exhibit several other well solvable cases.
Keyword:
Flowshop
Coupled-operations
Complexity
Polynomial time algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
COMPUTER SIMULATIONS OF MULTIPLE ORGAN FAILURE SECONDARY TO SHOCK AND SEPSIS WITH A MULTI-TISSUE, ENDOTHELIAL-LEVEL AGENT BASED MODEL..png)
Shock
OAAI
ShockIF0
OAAI分享收藏Clinical Impact and Outcomes of Socioeconomic Status on Patients with Sickle Cell Disease: A Pilot Study and Literature ReviewBlood
OAAI
BloodIF0
OAAI分享收藏Incidence and Management of Menstrual Disorders and Foods Implicated Among Nigerian Adolescents
PREAI
分享收藏
查看更多内容