.png){kind=icon}
返回
Cyclic scheduling in robotic flowshops
.png){kind=icon}
OA
AI
DOI：10.1023/A:1018995317468.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fully automated production cells consisting of flexible machines and a material handling robot have become commonplace in contemporary manufacturing systems. Much research on scheduling problems arising in such cells, in particular in flowshop-like production cells, has been reported recently. Although there are many differences between the models, they all explicitly incorporate the interaction between the materials handling and the classical job processing decisions, since this interaction determines the efficiency of the cell. This paper surveys cyclic scheduling problems in robotic flowshops, models for such problems, and the complexity of solving these problems, thereby bringing together several streams of research that have by and large ignored one another, and describing and establishing links with other scheduling problems and combinatorial topics.
Keyword:
TIME-WINDOW CONSTRAINTS
MANUFACTURING SYSTEMS
JOB SHOPS
CELL
ALGORITHM
COMPLEXITY
BLOCKING
NUMBER
HOIST
LINE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
