Relative to job-shop scheduling problems that optimize makespan or flow time, due-date-related problems are usually much more computationally complex and are classified as strongly NP-hard. In this paper, a hybrid framework integrating a heuristic and a genetic algorithm (GA) is utilized for...