Optimization Online


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

M. Selim Akturk (akturk***at***bilkent.edu.tr)
Alper Atamturk (atamturk***at***berkeley.edu)
Sinan Gurel (sgurel***at***bilkent.edu.tr)

Abstract: We describe a polynomial-size conic quadratic reformulation for a machine-job assignment problem with separable convex cost. Because the conic strengthening is based on only 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.


Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 2: Linear, Cone and Semidefinite Programming (Second-Order Cone Programming )

Citation: Appeared in Operations Research Letters. Check http://www.ieor.berkeley.edu/~atamturk/


Entry Submitted: 06/26/2007
Entry Accepted: 06/27/2007
Entry Last Modified: 05/21/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society