Browsing by Author "Kharbeche, M."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Placeholder
    Conference paperPublicationMetadata only
    Exact method for robotic cell problem
    (Elsevier, 2010-08-01) Kharbeche, M.; Carlier, J.; Haouari, Mohamed; Moukrim, A.; Industrial Engineering; HAOUARI, Mohamed
    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.
  • Placeholder
    ArticlePublicationMetadata only
    Exact methods for the robotic cell problem
    (Springer Science+Business Media, 2011-06) Kharbeche, M.; Carlier, J.; Haouari, Mohamed; Moukrim, A.; Industrial Engineering; HAOUARI, Mohamed
    This paper investigates an exact method for the Robotic Cell Problem. We present a branch-and-bound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. Also, we propose a new mathematical programming model as well as new lower bounds. Furthermore, we describe an effective genetic algorithm that includes, as a mutation operator, a local search procedure. We report the results of a computational study that provides evidence that medium-sized instances, with up to 176 operations, can be optimally solved. Also, we found that the new proposed lower bounds outperform lower bounds from the literature. Finally, we show, that the genetic algorithm delivers good solutions while requiring short CPU times.