THE PRIORITISATION OF PRODUCTION ORDERS UNDER THE BEE COLONY ALGORITHM

The paper presents the problem of determining the prioritisation of production orders. The proposed criterion function allows a comprehensive evaluation of various ways of prioritising taking into account both the income derived from the execution of production orders and the penalty for any delays which may occur. The criterion function was implemented in an algorithm based on the operation of a colony of bees. The experiments which have been carried out make it possible to evaluate the solutions obtained through the provided algorithm and compare them with the solutions obtained through the typical heuristic rules. The results show that the prioritisation obtained through the algorithm is characterized by the highest qualities of the criterion function and is definitely superior to that obtained through the simple heuristic rules.W pracy przedstawiono zagadnienia ustalania kolejności wprowadzania zleceń do produkcji. Zaproponowano zastosowanie kompleksowej funkcji kryterialnej do oceny różnorodnych uszeregowań. Funkcja ta uwzględnia zarówno przychód uzyskany z realizacji zleceń produkcyjnych, jak i ewentualne kary za opóźnienia w ich wykonaniu. Opracowano algorytm oparty na działaniu roju pszczół, w którym zaimplantowano proponowaną funkcję kryterialną. Wykonane eksperymenty pozwoliły na ocenę uszeregowań uzyskiwanych z użyciem algorytmu pszczelego oraz ich porównanie z rozwiązaniami dla typowych reguł heurystycznych. Analiza otrzymanych wyników pozwoliła na stwierdzenie, że uszeregowania uzyskiwane z zastosowaniem opracowanego algorytmu cechowały się największymi wartościami funkcji kryterialnej. Zdecydowanie przewyższały uszeregowania uzyskiwane z wykorzystaniem prostych reguł heurystycznych

Modeling of high storage sheet depot with Plant Simulation

Manufacturing processes are becoming increasingly automated. Introduction of innovative solutions often necessitate processing very large number of signals from various devices. Correctness tests of the components configuration becomes a compiled operation requiring vast expenditure of time and knowledge. The models may be a mathematical reflection of the actual object. Many actions can be computer-assisted to varying degree. One example is construction of simulation models. These can also be simulation models developed in advanced software. The stages of creating a model may be purely random. This paper aims at a closer analysis of the simulation model based on the high storage sheet depot modeling using Plant Simulation software. The results of analysis can be used for optimization, but this stage is a separate issue. Keywords: Plant Simulation, simulation, model, warehouse, sheet depot

Analiza problemu optymalnego zamawiania materiałów w systemach klasy ERP

The paper is concerned with a specific element of an ERP-class system – the Technical Production Preparation module (TPP) used by a company producing metal components. The module is responsible, inter alia, for determining the amount of material required to complete a specific order. The authors have presented a problem encountered by ERP system users while working with the Technical Production Preparation module.W pracy prowadzono analizę wybranego fragmentu systemu ERP – modułu Technicznego Przygotowania Produkcji w firmie wytwarzającej wyroby metalowe. Moduł odpowiedzialny jest między innymi za określenie zapotrzebowania na materiał niezbędny do produkcji wyrobu zleconego. Przedstawiono problemy użytkowników systemu ERP w trakcie pracy z modułem Technicznego Przygotowania Produkcji

Scheduling production orders, taking into account delays and waste

The article addresses the problem of determining the sequence of entering orders for production in a flexible manufacturing system implementing technological operations of cutting sheet metal. Adopting a specific ranking of production orders gives rise to the vector of delays and waste in the form of incompletely used sheets. A new method was postulated for determining the optimal sequence of orders in terms of two criteria: the total cost of delays and the amount of production waste. The examples illustrate the advantages of the proposed method compared with the popular heuristic principles

Determining the minimum sum of production order delays in a two-machine system

One of the main tasks in the planning of production processes is to satisfy the needs of the customers in terms of quantity, quality and time. The issue of the timely execution of production orders is becoming increasingly important. Based on the conducted studies it can be concluded that the size of the delay depends on the adopted scheduling of orders. This paper focuses on the problem of implementing a scheduling of production orders that will allow to avoid delays, and in the event such a scheduling is not possible, for minimizing the sum of delays of all the orders. A new algorithm has been proposed that allows to determine of the optimal sequence of production orders with the minimum sum of delays. The considerations have been limited to the issue of a two-machine system in which the orders are carried out in a flow

Szeregowanie zleceń produkcyjnych z zastosowaniem algorytmu pszczelego

The paper presents the problem of determining the prioritisation of production orders. The proposed criterion function allows a comprehensive evaluation of various ways of prioritising taking into account both the income derived from the execution of production orders and the penalty for any delays which may occur. The criterion function was implemented in an algorithm based on the operation of a colony of bees. The experiments which have been carried out make it possible to evaluate the solutions obtained through the provided algorithm and compare them with the solutions obtained through the typical heuristic rules. The results show that the prioritisation obtained through the algorithm is characterized by the highest qualities of the criterion function and is definitely superior to that obtained through the simple heuristic rules.W pracy przedstawiono zagadnienia ustalania kolejności wprowadzania zleceń do produkcji. Zaproponowano zastosowanie kompleksowej funkcji kryterialnej do oceny różnorodnych uszeregowań. Funkcja ta uwzględnia zarówno przychód uzyskany z realizacji zleceń produkcyjnych, jak i ewentualne kary za opóźnienia w ich wykonaniu. Opracowano algorytm oparty na działaniu roju pszczół, w którym zaimplantowano proponowaną funkcję kryterialną. Wykonane eksperymenty pozwoliły na ocenę uszeregowań uzyskiwanych z użyciem algorytmu pszczelego oraz ich porównanie z rozwiązaniami dla typowych reguł heurystycznych. Analiza otrzymanych wyników pozwoliła na stwierdzenie, że uszeregowania uzyskiwane z zastosowaniem opracowanego algorytmu cechowały się największymi wartościami funkcji kryterialnej. Zdecydowanie przewyższały uszeregowania uzyskiwane z wykorzystaniem prostych reguł heurystycznych

Optimization of the sequence of production orders on account of minimum delay

W artykule rozważany jest problem ustalania kolejności wprowadzania zleceń do produkcji w dynamicznym środowisku produkcyjnym. Przyjęto założenie, że możliwe jest dodawanie kolejnych zleceń produkcyjnych w trakcie pracy systemu wytwórczego. Zaproponowano nową metodę wyznaczania takiej kolejności zleceń, która jest optymalna ze względu na minimalną sumę opóźnień. Metoda ta daje lepsze rozwiązania niż metoda minimalnego terminu realizacji, czasu obróbki, czy zapasu czasu.According to the prevailing marketing trend that seeks to fulfil the customer's needs in their entirety, timely execution of production orders became the main criterion for evaluation of the quality of the company's performance. One way of achieving this aim is a proper planning of technological processes and a proper arrangement of production orders to be executed. This paper investigates the issue of sequencing the production orders in a dynamic manufacturing environment. It is assumed that it is possible to add further production orders while the manufacturing system is in operation. A new method for determining the sequence of production orders is proposed; the method is optimal with regard to minimizing the sum of tardiness. The algorithm designed allows deciding whether the base sequence, determined by the minimum deadline calculation, is optimal with regard to minimizing the sum of tardiness. Otherwise, a new sequence of production orders that is optimal in terms of minimizing the sum of tardiness is determined. The method yields better results than the method of minimum deadline, machining time, or time reserve

The optimal sequence of production orders, taking into account the cost of delays

In flexible manufacturing systems the most important element in determining the proper course of technological processes, transport and storage is the control and planning subsystem. The key planning task is to determine the optimal sequence of production orders. This paper proposes a new method of determining the optimal sequence of production orders in view of the sum of the costs related to the delayed execution of orders. It takes into account the different unit costs of delays of individual orders and the amount of allowable delays of orders involving no delay costs. The optimum sequence of orders, in the single-machine problem, in view of the sum of the costs of delays may be significantly different from the optimal order, taking into account the sum of delay times

Minimization of delay costs in the realization of production orders in two-machine system

The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted

Minimization of Delay Costs in the Realization of Production Orders in Two-Machine System

The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted