|
|||||
|
|
Exact methods for the robotic cell problem |
|
| Authors: | Mohamed Kharbeche Jacques Carlier Mohamed Haouari Aziz Moukrim |
| Affiliation: | 1. UMR CNRS 6599 Heudiasyc, Centre de Recherches de Royallieu, Universit?? de Technologie de Compi??gne, Compi??gne, France 3. LISI, National Institute of Applied Sciences and Technology, University of Carthage, Tunis, Tunisia 2. Department of Industrial Engineering, Faculty of Engineering, Ozyegin University, Istanbul, Turkey 4. Princess Fatimah Alnijris?? Research Chair for AMT, College of Engineering, King Saud University, Riyadh, Saudi Arabia |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |