ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS
https://doi.org/10.21686/2500-3925-2015-3-238-240
Abstract
The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network implementationschedules of scientific, economic or technical projects. Tools to solve suchproblems are included in the decisionsupport system ACS in many businesses.The effectiveness of the proposed algorithm allows solving with it specifi c for practice large-scale problems.
About the Author
Gennady A. Berketov
Moscow State University of Economics, Statistics and Informatics
Russian Federation
Russian Federation
References
1. Чернявский А.Л. Алгоритм для решения комбинаторных задач, основанные на методе неявного перебора/ Автоматикаителемеханика, №2, 1972.
2. Беркетов Г.А. К вопросу о решении обобщенной задачи построения расписания /Сб. Математическиеметодырешенияинженерных задач - М.: МОСССР, 1978.
3. Brooks G.H., White C.R. An algorithm for finding optimal or near optimal solutions to the production scheduling problem. J. Indust. Eng., V.16, №1, 1965.
4. Shrade L. Solving resource - constrained network problems by implicit enumeration nonpreemptive case. Oper. Res., V. 188, №2, 1970.
5. Chernjavski A.L. An algorithm for solving combinatorial problems based on the implicit enumeration / Avtomatika i telemehanika, №2, 1972.
6. Berketov A.G. To the question of the solution of a generalized problem for scheduling / Sb. Matematicheskie metody resheniya inzhenernyh zadach - M.: MO SSSR, 1978.
7. Brooks G.H., White C.R. An algorithm for finding optimal or near optimal solutions to the production scheduling problem. J. Indust. Eng., V. 16, №1, 1965.
8. Shrade L. Solving resource - constrained network problems by implicit enumeration nonpreemptive case. Oper. Res., V. 188, №2, 1970.
Review
For citations:
Berketov G.A. ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS. Statistics and Economics. 2015;(3):238-240. (In Russ.) https://doi.org/10.21686/2500-3925-2015-3-238-240
Views:
754
.png)
.png)
Email this article 