A memetic algorithm for the discrete scheduling-location problem with unrelated machines

This research explores integrated and sequential approaches to a combined job scheduling and discrete facility location optimization problem (ScheLoc). The makespan is considered as a criterion for job scheduling. A Tabu Search based Memetic Algorithm (TSMA) has been developed and applied for the former approach due to the NP-hardness of ScheLoc. For the latter approach, the problem is decomposed into two sub-problems m-median and parallel job scheduling with unrelated machines. Extensive numerical tests have confirmed the advantage of the integrated optimization strategy ensured by TSMA in terms of the makespan and the computation time. Conducted computational experiments have also shown the improvement of results generated by TSMA in comparison with another algorithm known from the literature.