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

Operations Research Letters

Volumn 37, Issue 3, 2009, Pages 187-191

  Aktürk, M Selim ^a   Atamtürk, Alper ^b   Gürel, Sinan ^a  

^a BILKENT UNIVERSITY   (Turkey)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Conic quadratic integer programming; Separable convex functions

Indexed keywords

COMPUTATIONAL RESULTS; CONIC QUADRATIC INTEGER PROGRAMMING; CONIC REFORMULATIONS; CONTROLLABLE PROCESSING TIME; CONVEX COSTS; JOB ASSIGNMENTS; SEPARABLE CONVEX FUNCTIONS;

COST FUNCTIONS; DYNAMIC PROGRAMMING;

INTEGER PROGRAMMING;

EID: 64949093409     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.12.009     Document Type: Article

References (18)

1. Alizadeh F., and Goldfarb D. Second-order cone programming. Mathematical Programming 95 (2003) 3-51
2. Ben-Tal A., and Nemirovski A. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization (2001), SIAM, Philadelphia
3. Sherali H.D., and Adams W.P. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems (1999), Kluwer Academic Publishers, Dordrecht, Boston, London
4. Tawarmalani M., and Sahinidis N.V. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications (2003), Springer, New York
5. Anjos M.F., and Wolkowicz H. Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Applied Mathematics 119 1-2 (2002) 79-106
6. Goemans M.X. Semidefinite programming in combinatorial optimization. Mathematical Programming 79 (1997) 143-161
7. Helmberg C., and Rendl F. Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes. Mathematical Programming 82 3 (1998) 291-315
8. Poljak S., Rendl F., and Wolkowicz H. A recipe for semidefinite relaxation for (0, 1)-quadratic programming. Journal of Global Optimization 7 1 (1995) 51-73
9. Çezik M.T., and Iyengar G. Cuts for mixed 0-1 conic programming. Mathematical Programming 104 (2005) 179-202
10. A. Atamtürk, V. Narayanan, Conic mixed-integer rounding cuts, Research Report BCOL.06.03, University of California-Berkeley, December 2006, Mathematical Programming, forthcoming (doi:10.1007/s10107-008-0239-4)
11. A. Atamtürk, V. Narayanan, Lifting for conic mixed-integer programming, Research Report BCOL.07.04, IEOR, University of California-Berkeley, October 2007, Mathematical Programming, forthcoming (doi:10.1007/s10107-008-0239-4)
12. Frangioni A., and Gentile F. Perspective cuts for a class of convex 0-1 mixed integer programs. Mathematical Programming 106 (2006) 225-236
13. O. Günlük, J. Lee, R. Weismantel, MINLP strengthening for separable convex qaudratic transportation-cost UFL, IBM Research Report RC24213, IBM, TJ Watson Research Center, York Town, NY, 2007
14. Gürel S., and Aktürk M.S. Considering manufacturing cost and scheduling performance on a CNC turning machine. European Journal of Operational Research 177 (2007) 325-343
15. Vickson R.G. Two single-machine sequencing problems involving controllable job processing times. AIEE Transactions 12 (1980) 258-262
16. Trick M.A. Scheduling multiple variable-speed machines. Operations Research 42 (1994) 234-248
17. Shabtay D., and Steiner G. A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155 (2007) 1643-1666
18. Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (1997) 831-841