AN EFFICIENT ILP FORMULATION FOR THE SINGLE MACHINE SCHEDULING PROBLEM

This paper considers the problem of schedulingn jobs ona single machine. A fixed processing time and an execution intervalare associated with each job. Preemption is not allowed. On the basisof analytical and numerical dominance conditions, an efficient integerlinear programming formulation is proposed for this problem, aimingat minimizing the maximum lateness ( Lmax). Experiments have beenperformed by means of a commercial solver that show that this formu-lation is effective on large problem instances. A comparison with thebranch-and-bound procedure of Carlier is provided