Aktürk, M. S.Atamtürk, A.Gürel, S.2016-02-082016-02-0820090167-6377http://hdl.handle.net/11693/22764We 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.EnglishConic quadratic integer programmingSeparable convex functionsComputational resultsConic quadratic integer programmingConic reformulationsControllable processing timeDynamic programmingInteger programmingA strong conic quadratic reformulation for machine-job assignment with controllable processing timesArticle10.1016/j.orl.2008.12.0091872-7468