Effective optimization methods for single-machine scheduling (Survey)

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.