Computational experiments with a cutting-plane algorithm for a time-indexed formulation

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We also present new valid inequalities, and we implement a basic cutting-plane algorithm based on these inequalities. Its performance is tested by running it on randomly generated instances.status: publishe