.png){kind=icon}
返回
A polynomial algorithm for 2-degree cyclic robot scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00175-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies the 2-degree cyclic scheduling of identical parts in a no-wait robotic flow shop where exactly two parts enter and leave the production line in a cycle. The objective is to minimize the cycle time. We propose a polynomial algorithm to find an optimal 2-degree cyclic schedule of robot moves. The algorithm can be implemented in O(N-8 logN) where N is the number of machines in the considered robotic cell. The proposed algorithm is also extended to problems where the two parts are not identical. Computational results is presented to test and evaluate the proposed algorithm. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
cyclic scheduling
transporting robot
cycle time minimization
complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Conformational analysis of thiophene-3-carbaldehyde and 3-methoxy carbonyl-thiophene.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容