Geodesic
New complexity results on scheduling problem in a robotic cell
Chikhi, Nacira1, 2 ; Abbas, Moncef1 ; Benmansour, Rachid2  ; Hanafi, Saïd2
1 Université des Sciences et de la Technologie USTHB, Laboratoire AMCD&RO, BP32, Bab-Ezzouar, 16111, Alger, Algérie.
2 Université de Valenciennes et du Hainaut Cambrésis, LAMIH – UMR CNRS 8201, Le Mont-Houy 59313 Valenciennes cedex 9, France.
RAIRO - Operations Research - Recherche Opérationnelle, Tome 51 (2017) no. 3, pp. 749-762

Voir la notice de l'article provenant de la source Numdam

This paper explores the coordinated scheduling problem between production and transportation in a two stage flow shop with dedicated machines. There are two dedicated machines at the first stage and one common machine at the second stage. Each job has to be processed on a specified machine at the stage 1 depending on job type. A transporter with limited capacity is available to transport the semi-finished jobs from stage 1 to stage 2 for further processing. The objective is to minimize the makespan, i.e. the maximum completion time of all the jobs. The main focus is on the case where the transporter capacity is equal to two. New complexity results related to this case are established. Due to the NP-hardness of the general problem, we develop approximative approach to tackle the problem. Computational results indicate that the obtained solutions within moderate CPU time are of high quality.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2016053
Classification : 90B35, 90C59, 90C11
Keywords: Flowshop, complexity, makespan, dynamic algorithm, tranportation

Chikhi, Nacira 1, 2 ; Abbas, Moncef 1 ; Benmansour, Rachid 2 ; Hanafi, Saïd 2

1 Université des Sciences et de la Technologie USTHB, Laboratoire AMCD&RO, BP32, Bab-Ezzouar, 16111, Alger, Algérie.
2 Université de Valenciennes et du Hainaut Cambrésis, LAMIH – UMR CNRS 8201, Le Mont-Houy 59313 Valenciennes cedex 9, France. 
@article{RO_2017__51_3_749_0,
     author = {Chikhi, Nacira and Abbas, Moncef and Benmansour, Rachid and Hanafi, Sa{\"\i}d},
     title = {New complexity results on scheduling problem in a robotic cell},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {749--762},
     publisher = {EDP-Sciences},
     volume = {51},
     number = {3},
     year = {2017},
     doi = {10.1051/ro/2016053},
     mrnumber = {3880523},
     zbl = {1384.90042},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2016053/}
}
TY  - JOUR
AU  - Chikhi, Nacira
AU  - Abbas, Moncef
AU  - Benmansour, Rachid
AU  - Hanafi, Saïd
TI  - New complexity results on scheduling problem in a robotic cell
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2017
SP  - 749
EP  - 762
VL  - 51
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2016053/
DO  - 10.1051/ro/2016053
LA  - en
ID  - RO_2017__51_3_749_0
ER  - 
%0 Journal Article
%A Chikhi, Nacira
%A Abbas, Moncef
%A Benmansour, Rachid
%A Hanafi, Saïd
%T New complexity results on scheduling problem in a robotic cell
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2017
%P 749-762
%V 51
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2016053/
%R 10.1051/ro/2016053
%G en
%F RO_2017__51_3_749_0
Chikhi, Nacira; Abbas, Moncef; Benmansour, Rachid; Hanafi, Saïd. New complexity results on scheduling problem in a robotic cell. RAIRO - Operations Research - Recherche Opérationnelle, Tome 51 (2017) no. 3, pp. 749-762. doi: 10.1051/ro/2016053

Cité par Sources :