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 131
- Downloads 0
Використання принципів локальності та звя’зності контексту в рекомендаційних системах
<span>Досліджено проблему релевантності вхідних даних в рекомендаційних системах. Дана проблема виникає внаслідок недостатньої диференціації даних про товари відносно споживачів, що не дозволяє в повній мірі індивідуаліз...
SYNTHESIS OF LOCAL AREA NETWORK STRUCTURE IN UNCERTAIN CONDITIONS OF INITIAL INFORMATION
The problem of taking into account the uncertainty of the initial information is identified in the tasks of the structure synthesis of local area networks. The analysis of the factors generating uncertainty is carried ou...
Контроль виконуваних екземплярів додатків в Windows 7/8/10
<span>Розроблено програмний модуль визначання переліку процесів, що виконуються в комп’ютері і надання інформації про їх поточний стан, ідентифікатори й пріоритети виконання активних процесів, перелік задіяних dll бібліо...
Моделирование осесимметричной теплопроводности в компактных изделиях керамического ядерного топлива с учетом температурных зависимостей теплофизических характеристик
<span>Обсуждаются возможности применения различных математических формулировок для моделирования осесимметрично теплопроводности компактных изделий керамического ядерного топлива. Показано, что применение уравнения тепло...
A fuzzy-based approach to automated defect identification in distributed software systems and software product lines
<span>An approach to the improvement of the efficiency of the bug tracking process in distributed software systems and software product lines via automated identification of duplicate report groups and report groups coll...