Computation of approximate α-points for large scale single machine scheduling problem

Computers and Operations Research

Volumn 35, Issue 10, 2008, Pages 3262-3275

  Gu, Han Yu ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Point; Lagrangian relaxation; Proximal bundle method; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; SCHEDULING;

LAGRANGIAN RELAXATION; PROXIMAL BUNDLE METHODS; SINGLE MACHINE SCHEDULING;

PROBLEM SOLVING;

EID: 40249109957     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.02.018     Document Type: Article

References (26)

1. Brucker P. Scheduling algorithms (1995), Springer, Berlin
2. Lenstra J., Kan A.R., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
3. Dyer M.E., and Wolsey L.A. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics 26 (1990) 255-270
4. Sousa J.P., and Wolsey L.A. A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming 54 (1992) 353-367
5. Hall L.A., Schulz A.S., Shmoys D.B., and Wein J. Scheduling to mimimize average completion time. off-line and on-line approximation algorithms. Mathematics of Operations Research 22 3 (1997) 513-544
6. Phillips C., Stein C., and Wein J. Minimizing average completion time in the presence of release dates. Mathematical Programming 82 (1998) 199-223
7. Goemans M.X., Queyranne M., Schulz A.S., Skutella M., and Wang Y. Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics 15 2 (2002) 165-192
8. Leung JY-T. editor. Handbook of scheduling: algorithms, models and performance analysis. London, Boca Raton: Chapman & Hall/CRC; 2004.
9. van den Akker J., Hurkens C., and Savelsbergh M.W. Time-indexed formulations for machine scheduling problems. column generation. INFORMS Journal on Computing 12 2 (2000) 111-124
10. Savelsbergh M.W., Uma R., and Wein J. An experimental study of lp-based approximation algorithms for scheduling problems. INFORMS Journal on Computing 17 1 (2005) 123-136
11. Guignard M. Lagrangian relaxation. TOP 11 2 (2003) 151-228
12. Briant O, Lemaréchal C, Meurdesoif P, Michel S, Perrot N, Vanderbeck F. Comparison of bundle and classical column generation. Technical Report No. 5453, INRIA; January 2005.
13. Lemaréchal C. Lagrangian relaxation. In: Junger M., Naddef D., editors. Computational combinatorial optimization. Berlin: Springer; 2001
14. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 1 (1981) 1-18
15. Frangioni A. About Lagrangian methods in integer optimization. Annals of Operations Research 139 (2005) 163-193
16. Kim S., Ahn H., and Cho S. Variable target value subgradient method. Mathematical Programming 48 (1991) 359-369
17. Kiwiel K. Proximity control in bundle methods for convex nondifferentiable minimization. Mathematical Programming 46 (1990) 105-122
18. Makela M.M. Survey of bundle methods for nonsmooth optimization. Optimization Methods and Software 17 1 (2002) 1-29
19. Schramm J.Z.H. A version of the bundle idea for minimizing a nonsmooth function. conceptual idea, convergence analysis, numerical results. SIAM Journal on Optimization 2 1 (1992) 121-152
20. Carraresi P, Frangioni A, Nonato M. Applying bundle methods to the optimization of polyhedral functions: an applications-oriented development. Technical Report TR-96-17, Dipartimento di Informatica, Universita di Pisa, corso Italia 40, 56125 Pisa, Italy; December 01, 1997.
21. Geoffrion A. Lagrangian relaxation and its uses in integer programming. Mathematical Programming Study 2 (1974) 82-114
22. Frangioni A., and Gallo G. A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. INFORMS Journal on Computing 11 4 (1999) 370-393
23. Kiwiel K. Efficiency of proximal bundle methods. Journal of Optimization Theory and Applications 104 3 (2000) 589-603
24. Kiwiel K. A cholesky dual method for proximal piecewise linear programming. Numerische Mathematik 68 (1994) 325-340
25. Frangioni A. Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Computers Operations Research 23 11 (1996) 1099-1118
26. Frangioni A., Lodi A., and Rinaldi G. New approaches for optimizing over the semimetric polytope. Mathematical Programming 104 (2005) 375-388