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

Creative Commons License

Akturk M. S., Atamturk A., Gurel S.

OPERATIONS RESEARCH LETTERS, cilt.37, sa.3, ss.187-191, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 37 Sayı: 3
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.orl.2008.12.009
  • Dergi Adı: OPERATIONS RESEARCH LETTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.187-191
  • Anahtar Kelimeler: Separable convex functions, Conic quadratic integer programming, SEMIDEFINITE, PROGRAMS, CUTS
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

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.