Comparing Mathematical and Heuristic Rules for Solving Single Machine Scheduling Problem with Release and due Date Constraints

The purpose of this paper is to compare a mixed integer programming (MIP) model, and heuristic rules based on their practical efficiency and the accuracy of results to tackle the minimum lateness single machine scheduling problem with release and due date constraints. Extensive numerical experiments are carried out on randomly generated testing instances in order to evaluate the performance of the MIP model and heuristic rules.