Speakers NEW!!! > Bendraouche Mohamed

sciencesconf.org:icma21:375162

SCHEDULING ON BATCH PROCESSING MACHINES WITH COMPATIBILITY GRAPH

Khaoula Bouakaz 1, @ , Mourad Boudhar 1, *, @ , Mohamed Bendraouche 1, *, @

1 : RECITS - Website

Faculté de Mathématiques, Université USTHB, B.P. 32, Bab-Ezzouar, El-Alia 16111, Alger, Algeria - Algeria

* : Corresponding author

We consider the problem of minimizing the makespan on batch processing identical parallel
machines, subject to compatibility constraints, where two jobs are compatibles if they can be
processed simultaneously in the same batch. These constraints are modeled by a graph in which
compatible jobs are represented by adjacent vertices. We show that several subproblems are polynomial. We propose certain exact polynomial algorithms to solve these subproblems.

Subject :	:	Oral
Topics	:	Operational research
Keywords	:	batch scheduling ; batch processing machine ; compatibility graph ; identical parallel machines.

Online user: 2

Privacy