ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS

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.

Keywords

• общая задача теории расписаний
• календарное планирование работ
• метод ветвей и границ
• системы поддержки принятия решений
• general problem of scheduling
• scheduling of work
• branch and boundmethod
• decision support system