A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups

A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence-dependent setup times, differing earliness/tardiness cost penalites, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to each optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.