Séminaire LIGM - Experimental comparison of two branch-and-bound algorithms for 1| p-batch, rj , pj , B < N |Cmax

Date: Thursday 26th november 2015

Experimental comparison of two branch-and-bound algorithms for 1| p-batch, rj , pj , B < N |Cmax

Abstract: in this study, we consider a parallel batch scheduling problem where jobs have different processing times, release dates and unit sizes and are processed on identical machines with a fixed capacity. After modeling the problem as a mixed integer linear model, we developped a branch and bound algorithm and compared it to the state of art branch and bound algorithm from the literature which can solve instances containing only a single machine. Computational experiments showed that our method is more efficient than the state of art method in terms of solution time. To the best of our knowledge, the branch and bound we proposed is the first exact method for the case of parallel identical machines.