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

Files

A_strong_conic_quadratic_reformulation_for_machine-job_assignment_with_controllable_processing_times.pdf (929.22 KB)

Date

2009

Authors

Aktürk, M. S.
Atamtürk, A.
Gürel, S.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
35
downloads

Citation Stats

  • Share

Series

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.

Source Title

Operations Research Letters

Publisher

Elsevier

Course

Other identifiers

Book Title

Keywords

Conic quadratic integer programming, Separable convex functions, Computational results, Conic quadratic integer programming, Conic reformulations, Controllable processing time, Dynamic programming, Integer programming

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/22764

Published Version (Please cite this version)

http://dx.doi.org/10.1016/j.orl.2008.12.009

Collections

Scholarly Publications - Industrial Engineering

Language

English

Type

Article