WWW.DISSERS.RU

...
    !

 >> 
Pages:     | 1 | 2 ||

5. .. // XL " - ", 16 18 . : - , 2002. C. 126 127.

6. Lazarev A.A., Sadykov R.R. A polynomial approximation scheme for the 1 | rj | Lmax scheduling problem with guaranteed absolute error// Arias Estrada M., Gelbukh A. (eds.) Avances en la Ciencia de la Computacin:

Proceedings of Fifth Mexican International Conference ENC04, 20 september. Colima, Mexico: 2004. P. 465 473.

7. Sadykov R. A hybrid branch-and-cut algorithm for the one-machine scheduling problem // Rgin, J.-C., Rueher M. (eds.) Proceedings of the First International Conference CPAIOR04, 20 22 april. SpringerVerlag, LNCS, V. 3011, 2004. P. 409 414.

8. Sadykov R.R., Lazarev A.A. Experimental comparison of branch-andbound algorithms for the 1 | rj | Lmax problem// Proceedings of the Seventh International Workshop MAPSP05, 6 10 june. Siena, Italy:

2005. P. 239 241.

9. Sadykov R.R., Lazarev A.A., Kvaratskhelia A.G. Research of absolute error for NP-hard scheduling problem minimizing maximum lateness// Proceedings of the Tenth Franch-German-Italian Conference on Optimization FGI00, 4 8 september. Montpelier, France: 2000. P. 56 57.

Pages:     | 1 | 2 ||
 >> 






2011 www.dissers.ru -