1. P. A. Kononova, “Lower and Upper Bounds for the Optimal Makespan in the Multimedia Problem,” Diskretn. Anal. Issled. Oper. 19(1), 59–73 (2012).
2. Yu. A. Kochetov, N. Mladenović, and P. Hansen, “Local Search with Alternating Neighborhoods,” Diskretn. Anal. Issled. Oper. Ser. 2, 10(1) 11–43 (2003).
3. J. Brimberg, P. Hansen, and N. Mladenović, “Convergence of Variable Neighborhood Search,” Les Cahiers du GERAD G-2000-73. (Montreal, Canada, 2000).
4. F. D. Croce, A. Grosso, and F. Salassa, “A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem,” in Lecture Notes in Computer Science, Vol. 6622 (Springer, Berlin, 2011), pp. 38–47.
5. E. Falkenauer, “A Hybrid Grouping Genetic Algorithm for Bin Packing,” J. Heuristics 2(1), 5–30 (1996).