A Computational Journey in Job Scheduling with Time-of-Use Costs

We present recent advances on both exact and heuristic algorithms for the bi-objective identical parallel machine scheduling with time-of-use costs problem. This problem belongs to the field of energy-efficient scheduling, which has received large attention during the last years in the literature on sustainable manufacturing. As a novel contribution, we investigate how multi-threaded computation is able to improve the performances of the current state-of-the-art approaches over a set of problem instances characterized by different sizes, ranging from small to large.