A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Aktürk, M. S.
Operations Research Letters
187 - 191
Item Usage Stats
MetadataShow full item record
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.
KeywordsConic quadratic integer programming
Separable convex functions
Conic quadratic integer programming
Controllable processing time