Russian Federation
Voronezh, Russian Federation
Voronezh, Voronezh, Russian Federation
In article the complex mechanized production line in the form of N-channel system of mass service with a limited waiting time is considered. From features of production, among other, storage conditions of semi-finished products and restriction on a storage time before some operations of the complex mecha-nized line are accepted. As the scheme of local search it is possible to choose the scheme similar to search of an extremum of functions of many variables as Gauss-Sejdel´s method.
system, Gauss-Sejdel´s method, local search, problem of combinatory type.
1. Venttsel´, E.S. Teoriya veroyatnostey [Tekst] : ucheb. dlya vuzov / E.S. Venttsel´. – M., 1999. – 576 s.
2. Gubko, M.V. Optimal´nye ierarkhii upravleniya dlya funktsiy zatrat, predstavimykh v vide summy odnorodnykh funktsiy [Tekst] / M.V. Gubko. Problemy upravleniya. – Kursk, 2009. – № 3 – S. 44-54.
3. Ignat´ev, M.B. Lingvo-kombinatornoe modelirovanie plokho formalizovannykh sistem [Tekst] / M.B. Ignat´ev. Informatsionno-upravlyayushchie sistemy. – Sankt-Peterburg, 2003. – № 6. – S. 34-38.
4. Kuznetsov, A.V. Rukovodstvo k resheniyu zadach po matematicheskomu programmirova-niyu [Tekst] / A.V. Kuznetsov, N.I. Kholod, L.S. Kostevich. – Minsk, 2001. – 263 s.
5. Kuznetsova, A.S. Ob odnoy zadache kombinatornoy optimizatsii [Tekst] / A.S. Kuzne-tsova, K.V. Safonov. Prikladnaya diskretnaya matematika. Prilozhenie. – Tomsk, 2012. – № 5. – S. 15-16.
6. Mishin, S.P. Optimal´noe delegirovanie upravleniya dlya funktsiy zatrat, predsta-vimykh v vide vypuklykh kvadratichnykh form [Tekst] / S.P. Mishin. Upravlenie bol´shimi sistemami: sbornik trudov. – Kursk, 2011. – № 35. – S. 136-164.
7. Samochernova, L.I. Optimizatsiya sistemy massovogo obsluzhivaniya s peremennoy intensivnost´yu, zavisyashchey ot vremeni ozhidaniya [Tekst] / L.I. Samochernova. Izvestiya tomskogo politekhnicheskogo universiteta. – Tomsk, 2009. – № 5. – S. 178-182.
8. Terpugov, A.F. Programma vychisleniya parametrov sistem massovogo obsluzhivaniya po periodu zanyatosti [Tekst] / A.F. Terpugov, A.S. Shkurkin. Vestnik Tomskogo gosudarst-vennogo universiteta. – Tomsk, 2003. – № 280.– S. 324-325.
9. Bertsimas, D. Probabilistic Combinatorial Optimization: Moments, Semidefinite Program-ming, and Asymptotic Bounds [Text] / D. Bertsimas, K. Natarajan, Chung-Piaw Teo. SIAM Jour-nal on Optimization. – 2004. – Vol. 15. – no. 1. – pp. 185-209.
10. Briest, P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Prob-lems [Text] / P. Briest, P. Krysta. SIAM Journal on Computing. – 2011. – Vol. 40. no. 6. – pp. 1554-1586.
11. Maslova, V.P. Unbounded probability theory and its applications [Text] / V.P. Maslova, T.V. Maslovab. Theory of Probability and its Applications. – 2013. – Vol. 57. – no. 3. – pp. 444-467.
12. Orlin, James B. Approximate Local Search in Combinatorial Optimization [Text] / James B. Orlin, Abraham P. Punnen, and Andreas S. Schulz. SIAM Journal on Computing. – 2004. – Vol. 33. – no. 5. – pp. 1201-1214.
