Kharbeche, M.Carlier, J.Haouari, MohamedMoukrim, A.2012-05-302012-05-302010-08-011571-0653http://hdl.handle.net/10679/185https://doi.org/10.1016/j.endm.2010.05.109Due to copyright restrictions, the access to the full text of this article is only available via subscription.This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NP-hard problem. In this paper, we propose a new mathematical formulation and we describe a new lower bound for the RCP. In addition, we propose a genetic algorithm. We report that the branch and bound algorithm is more effective than the proposed mathematical formulation which can solve small sized problem. Also, computational study provides evidence that the genetic algorithm delivers reasonably good solutions while requiring significantly shorter CPU times to solve this problem.engrestrictedAccessconferenceObject3685986610.1016/j.endm.2010.05.109Robotic cellMathematical formulationGABranch and bound2-s2.0-77954940516