.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
cyclic scheduling
transporting robot
cycle time minimization
complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveConformational analysis of thiophene-3-carbaldehyde and 3-methoxy carbonyl-thiophene.png)
Tetrahedron
TetrahedronIF0
PREAI
ShareSave
ShareSaveShareSaveShareSave no more
no more