Geodesic
Effective optimization methods for single-machine scheduling (Survey)
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part V, Tome 111 (1981), pp. 195-217 
K. V. Shakhbazyan; N. B. Lebedinskaya. Effective optimization methods for single-machine scheduling (Survey). Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part V, Tome 111 (1981), pp. 195-217. http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a15/
@article{ZNSL_1981_111_a15,
     author = {K. V. Shakhbazyan and N. B. Lebedinskaya},
     title = {Effective optimization methods for single-machine scheduling {(Survey)}},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {195--217},
     year = {1981},
     volume = {111},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a15/}
}
TY  - JOUR
AU  - K. V. Shakhbazyan
AU  - N. B. Lebedinskaya
TI  - Effective optimization methods for single-machine scheduling (Survey)
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1981
SP  - 195
EP  - 217
VL  - 111
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a15/
LA  - ru
ID  - ZNSL_1981_111_a15
ER  - 
%0 Journal Article
%A K. V. Shakhbazyan
%A N. B. Lebedinskaya
%T Effective optimization methods for single-machine scheduling (Survey)
%J Zapiski Nauchnykh Seminarov POMI
%D 1981
%P 195-217
%V 111
%U http://geodesic.mathdoc.fr/item/ZNSL_1981_111_a15/
%G ru
%F ZNSL_1981_111_a15

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

The article focuses on effective single-machine scheduling algorithms. We consider the optimization of a function $f$ defined on feasible permutations assuming that the function $f$ induces certain job interchange relations. The interchange relations include “job insertion”, interchange of symbol chains, and the mutually complementary properties of interchange and embedding. Some new nontraditional problem formulations are considered together with the corresponding methods of solution.