EFFICIENCY RESEARCH OF THE THREE-LEVEL MODEL OF SMALL-SERIES PRODUCTION PLANNING
Journal Title: Вісник Національного технічного університету «ХПІ». Серія: Системний аналiз, управління та iнформацiйнi технологiї - Year 2018, Vol 1320, Issue 44
Abstract
We consider the problem of finding an order portfolio that maximizes the total profit according to one of five optimization criteria and should fit the beginning date of the planned period and the due dates specified by the customers. Also, we need to build for this order portfolio a feasible (not violating the due dates) operational plan of jobs processing that would correspond to the minimum possible processing time of the entire order portfolio. We show that the problem in this formulation is a multi-stage scheduling problem. We describe previously developed methodology for the problem solving: the three-level model of production planning. We substantiate the possibility of applying the methodology for any type of small-series production according to one of the five criteria of optimality. We show that independently of the production type considered, whatever is the original production technology, and no matter how the multi-stage scheduling problem is implemented, we reduce the planning problem solving for any of the five optimality criteria to obtaining a feasible solution of the multi-stage scheduling problem for the criterion of maximizing the start time of the earliest job. We show that the efficiency of the multi-stage scheduling problem solving depends on the efficiency of solving the first level of the three-level model. Therefore, we statistically investigate and prove the efficiency of solving the problem of minimizing the total weighted completion time of jobs with precedence relations on a single machine. We show the efficiency of PSC-algorithm for the problem solving for the case when the weights of only terminal vertices of the precedence graph are non-zero. We have shown that the approximation algorithm for this problem solving allows to solve real practical large size problems (we checked dimensions of up to 10,000 jobs). The solutions obtained by the approximation algorithm coincided with those obtained by the exact PSC-algorithm in 99.97 % cases.
Authors and Affiliations
Taras Lisetsky
Keywords
Related Articles
- EP ID EP465216
- DOI 10.20998/2079-0023.2018.44.04
- Views 122
- Downloads 0
Исследование движения магнитогазодинамических ударных волн в неоднородной плазменной среде методом Уизема
<span>Рассматривается распространение плоской магнитогазодинамической ударной волны в неоднородной плазменной среде. Исследование проводилось методом Уизема, который был использован для случая поперечного магнитного поля...
Technology of multiple-criteria synthesis and choice of distributed organizational management structure of distribution logistics system
<span>Technology of the creation of distributed organizational management structure of logistics distribution system is proposed in this study and consists of the following stages: synthesis of logistics system configura...
РОЗВ’ЯЗАННЯ МАТРИЧНОГО РІВНЯННЯ СІЛЬВЕСТРА СПЕКТРАЛЬНИМ МЕТОДОМ
Матричні лінійні рівняння Сільвестра та Ляпунова широко використовуються в теорії управління і теорії стійкості руху, а також при розв’язанні рівняння Ріккаті у задачі аналітичного конструювання оптимальних регуляторів....
Метод поэлементной многокритериальной композиции оптимальных маршрутов в транспортных сетях
<span>Предложен простой метод отыскания оптимальных маршрутов в транспортной задаче линейного программирования. Задача решена с использованием совокупности критериев: средняя суммарная стоимость транспортировок, продолжи...
Situational forecasting of electricity demand in the region
<span>The process of forecasting volumes of electricity sales on the wholesale market is considered. To improve the quality of the forecast, it is proposed to use the method of machine learning Random Forests as part of...