Identical parallel machine scheduling with time-dependent processing times

A numerical experiment study is performed to evaluate the effectiveness of the proposed algorithm by comparison with three heuristic methods inspired by the literature. The obtained results show that for the two-machine case, the proposed optimal algorithm performs very well even for large instances. For the general case with m>2, the obtained results show that the extended version of the algorithm outperforms significantly the heuristic methods.