Exact methods for the robotic cell problem

Name: Exact methods for the robotic cell problem
Author: Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.

İsim	Exact methods for the robotic cell problem
Yazar	Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.
Basım Tarihi:	2011-06
Basım Yeri	- Springer Science+Business Media
Konu	Robotic cell, Flow shop with transportation times and blocking, Branch-and-bound, Lower bounds, Genetic algorithms
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1936-6582
Kayıt Numarası	40b5286c-0369-458f-b361-38f8f3299939
Lokasyon	Industrial Engineering
Tarih	2011-06
Örnek Metin	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.
DOI	10.1007/s10696-011-9079-2
Cilt	23

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Exact methods for the robotic cell problem

Yazar Kharbeche, M., Carlier, J., Haouari, Mohamed, Moukrim, A.

Basım Tarihi 2011-06

Basım Yeri - Springer Science+Business Media

Konu Robotic cell, Flow shop with transportation times and blocking, Branch-and-bound, Lower bounds, Genetic algorithms

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1936-6582

Kayıt Numarası 40b5286c-0369-458f-b361-38f8f3299939

Lokasyon Industrial Engineering

Tarih 2011-06

Örnek Metin 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.

DOI 10.1007/s10696-011-9079-2

Cilt 23