On Scheduling a Single Machine to Minimize a Piecewise Linear Objective Function: A Compact MIP Formulation.

The article presents a study on a new, efficient and nontrivial Mixed Integer Program (MIP) formulation that can be used on variety of single machine scheduling problem. It notes that the introduced MIP is closely related to the well-known time-indexed MIP formulation but utilizes less variables and constraints. Based on the experiments on academic benchmarks and real-life industrial problems, it is concluded that the generic MIP formulation is efficient.