New complexity results on scheduling problem in a robotic cell

Nacira Chikhi (1, 2) , Moncef Abbas (1) , Rachid Benmansour (2) , Said Hanafi (2)

1 USTHB - Université des Sciences et de la Technologie Houari Boumediene = University of Sciences and Technology Houari Boumediene [Alger]
2 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201

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.

Mots clés: Flowshop; complexity; makespan; dynamic algorithm; tranportation

Domaines: Recherche opérationnelle [math.OC]

Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Said Hanafi. New complexity results on scheduling problem in a robotic cell. RAIRO - Operations Research, 2017, 51 (3), pp.749-762. ⟨10.1051/ro/2016053⟩. ⟨hal-03402259⟩