Throughput optimisation in reentrant circular regular robot cells

Ali Khebouche, Mourad Boudhar and El-Sedik Lamini

International Journal of Mathematics in Operational Research, 2023, vol. 26, issue 1, 111-142

Abstract: We consider robot cells of type reentrant circular flow shop served by a single-gripper central robot having the ability to swap. The objective is to find a cyclic sequence of robot moves that minimises the cycle time of one-unit required to produce a part or, equivalently, that maximises the throughput. We analysed three-machine robot cells in-depth showing that four of the feasible one-unit cycles dominate the remaining 17 cycles. We determined the parameter regions in which each of the four cycles is optimal. In the case of m machines, we gave two new lower bounds with an emphasis on four cycles that are specific among all one-unit cycles. Initially, cycle time formulas are created for the four cycles of one-unit. In addition, we established the parameter regions where each of the cycles is best. Finally, we showed that a specific cycle provides a 3/2-approximation for the remaining unique region.

Keywords: circular robot cells; chain-reentrant; throughput maximisation; cyclic production; flow-shop scheduling. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=133717 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:26:y:2023:i:1:p:111-142

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().