A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness

This paper involves an unrelated parallel machine scheduling problem. Setup times are sequence dependent. A mixed integer linear programming model that represents the system is formulated. Two measures of performance, makespan, total tardiness, and a combination of both measures, are minimize. Results from a numerical example show that, with a proper weight between the two measures, a compromise solution can be found.