Minimizing earliness and tardiness costs in scheduling jobs with time windows

To the best of our knowledge, no prior research has thoroughly addressed this scheduling problem. Three methods based on the mixed integer programming (MIP), namely, the hard-constraint mixed integer programming (HCMIP), the earliness-tardiness mixed integer programming (ETMIP), and the three-phase heuristics-initialized mixed integer programming (HIMIP), are proposed and tested. The experiment results show that HIMIP is the most effective in solving the problem.