Program > By speacker > Bekrar Abdelghani

Most of machine scheduling models in the literature assume that either transportation capacity of transporters for delivering jobs is unlimited or transportation times from one location to another are negligible. In this paper, we study a two stages robotic flow shop problem which is a scheduling problem in a robotic cell with dedicated machines at the first stage and a common machine at the second stage. There are several applications of this problem in automated manufacturing systems especially in flexible manufacturing cells. We have two types of jobs. Each one has to be executed on a dedicated machine at the first stage and the jobs are transported in batches between the two stages by a conveyor with a limited capacity c. The objective is to find a joint schedule of production and transportation such that the makespan is minimized. First, we provide new complexity results, more precisely we prove that a special case of the problem with conveyor capacity c=2 is NP-Hard by a reduction from 3-Partition problem and we establish new lower bounds on the makespan. Next, we propose an exact method to solve a particular problem. Finally, computational experiments are designed on randomly generated problem instances to compare our exact method with other approaches in the litterature. The numerical experiments show the efficiency of our method.