Hide/Show Apps

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

Akturk, M. Selim
Atamturk, Alper
Gürel, Sinan
we describe a polynomial-size conic quadratic reformulation for a machine-job assignment problem with separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation. (C) 2009 Elsevier B.V. All rights reserved.