Algorithm for solution of multicriterion problem of production planning of pipes and shaped products

One of the modern directions of increase in economic efficiency of the enterprise is a production planning automation, including the automated scheduling of production. Introduction of ready program solutions for automated preparation of production schedules (APS, MES-systems) at enterprises is constrained by the complexity and high cost of adapting to the specific conditions of the enterprise, implementation and maintenance. The complexity of the problem is determined by a large number of product names, rapid changes in the operational environment and the need for clear interaction with the warehouse. The task is multicriterion as it is necessary to provide the maximum loading of each production line with a minimum of readjustments, and at the same time the schedule must comply with the terms of shipment of products, taking into account the availability of raw materials for production. Therefore, the authors have developed an algorithm and software that allow for an acceptable time to make an admissible, often optimal schedule for the production of preinsulated pipes and shaped products in batches with the individual completion of consistent service, taking into account production and technological limitations in SMITH-Yartsevo, Ltd (Russia). In this case, each group of products is divided into batches in accordance with the McNaughton rule (wrap around rule), and the resulting batches are distributed along the production lines. For the choice of the optimal schedule it is necessary to make several schedules with different values of the number of readjustments and select the one that best meets the criteria of the task.

1. Захарченков, К. В. Планирование материальных потребностей склада в ООО «СМИТ-Ярцево» / К. В. Захарченков, Т. В. Мрочек // Энергетика, информатика, инновации – 2017 (электроэнергетика, электротехника и теплоэнергетика, математическое моделирование и информационные технологии в производстве): сб. трудов VII-ой межд. науч. техн. конф.: в 3 т.– 2017. – Т. 1. – С. 268–271.

2. Лазарев, А. А. Теория расписаний. Задачи и алгоритмы / А. А. Лазарев, Е. Р. Гафаров. – М.: Московский государственный университет им. М. В. Ломоносова, 2011. – 222 c.

3. Ковалев, М. Я. Календарное планирование. Курс лекций / М. Я. Ковалев [Электронный ресурс]. – Режим доступа: https://www.bsu.by/Cache/pdf/177553.pdf. – Дата доступа: 01.02.2018.

4. Танаев, B. C. Теория расписаний. Групповые технологии / B. C. Танаев, М. Я. Ковалёв, Я. М. Шафранский. – Минск: Институт технической кибернетики НАН Беларуси, 1998. – 290 с.

5. Butterworth, R. Machine scheduling [Electronic resource] / R. Butterworth // Department of Combinatorics and Optimization of University of Waterloo. – 1979. – Mode of access: http://rbutterworth.nfshost.com/Scheduling/1.7-parallel. – Date of access: 01.04.2018.

6. McNaughton, R. Scheduling with deadlines and loss functions [Electronic resource] // Management Science (pre-1986); ABI INFORM Global. – 1959. – Vol. 6, № 1. – P. 1–12. – Mode of access: http://www.columbia.edu/cs2035/courses/ieor8100.F16/mcn1.pdf/. – Date of access: 01.04.2018.

7. Сотсков, Ю. Н. Математические модели и методы календарного планирования: учеб. пособие / Ю. Н. Сотсков, В. А. Струсевич, В. С. Танаев. – Минск: Университетское, 1994. – 232 с.

8. Танаев, В. С. Теория расписаний. Одностадийные системы / В. С. Танаев, В. С. Гордон, Я. М. Шафранский. – Москва: Наука. Главная редакция физико-математической литературы, 1984. – 384 c.