Genetic algorithm for parallel-machine batching and scheduling to minimize total weighted tardiness

This paper considers parallel batch-processing machine problems with compatible job family, dynamic job arrivals, and non-identical job sizes to minimize total weighted tardiness. Given that the problem of interest is non-deterministic polynomial-time (NP) hard, we propose a hybrid genetic algorithm (HGA) that incorporates batching decision and batch scheduling. Moreover, HGA is compared with simulated annealing (SA) algorithms to assess the performance of the proposed algorithm. Computational results revealed that the proposed HGA outperformed in terms of the number of best solution found, and HGA is slightly better when comparing the average TWT value.