A strong conic quadratic reformulation for machine-job assignment with controllable processing times |
| |
| Authors: | M Seli?m Aktürk Si?nan Gürel |
| |
| Institution: | a Department of Industrial Engineering, Bilkent University, 06800 Bilkent, Ankara, Turkey
b Department of Industrial Engineering & Operations Research, University of California, Berkeley, CA 94720-1777, USA |
| |
| 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 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. |
| |
| Keywords: | Separable convex functions Conic quadratic integer programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
