Sciweavers

Share
EOR
2010

An optimization-based heuristic for the robotic cell problem

9 years 6 days ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transportation robot and a blocking constraint. We propose an approximate decomposition algorithm. The proposed approach breaks the problem into two scheduling problems that are solved sequentially: a ow shop problem with additional constraints (blocking and transportation times) and a single machine problem with precedence constraints, time lags, and setup times. For each of these problems, we propose an exact branch-and-bound algorithm. Also, we describe a genetic algorithm that includes, as a mutation operator, a local search procedure. We report the results of a computational study that provides evidence that the proposed optimization-based approach delivers high-quality solutions and consistently outperforms the genetic algorithm. However, the genetic algorithm delivers reasonably good solutions while requiring...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where EOR
Authors Jacques Carlier, Mohamed Haouari, Mohamed Kharbeche, Aziz Moukrim
Comments (0)
books