Two-machine reentrant circular robotic cells with swap ability
by Ali Khebouche; Mourad Boudhar
International Journal of Computing Science and Mathematics (IJCSM), Vol. 19, No. 3, 2024

Abstract: We consider a robotic cell consisting of two machines placed circularly and a robot with swap ability, operating under the constraint of a reentrant chain where a processed part must return to the first machine. The objective is to determine the optimal cycle time for one unit to maximise throughput. We conducted an in-depth analysis of two-machine robot cells in unbalanced cases. We developed cycle time formulas for the six feasible one-unit cycles and found that three of these cycles outperformed the other three. We then determined the parameter regions in which each of the three cycles was optimal. Our study offers insights to improve reentrant robot cell efficiency and management recommendations for utilising the robot with swap ability.

Online publication date: Fri, 05-Apr-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com