# Modelling Decision-Making Processes in the Management Support of the Manufacturing Element in the Logistic Supply Chain

Authors: Robert Bucki; Petr Suchánek
Journal: Complexity
 (2017)

---

## Abstract

This paper highlights the problems of mathematical modelling for a specific element of the logistic supply chain, that is, the manufacturing system. The complex manufacturing system consisting of a determined number of parallel subsystems is modelled. The fact that the same manufacturing procedure can be carried out in various locations is emphasised. Control algorithms as well as manufacturing strategies are explained. The equations of state are introduced. The two-stage criterion lets us use the result data generated by the simulator of the production system as the initial data for further processing; however, the main goal remains to minimise the time of the course of production. The precisely elaborated case study implements initial data obtained by preceding simulation procedures carried out in manufacturing systems consisting of three, four, and five subsystems.


---

## Body

## 1. Introduction

Nowadays, design and optimisation of logistic and production systems is a demanding and important area. Businesses are pushed to improve their performance, decrease production prices, and increase variability of their products or shorten delivery times. If a company fails to adapt to these requirements, it cannot normally survive in the contemporary market environment. To survive in the highly competitive global economy, manufacturing systems must be able to adapt to new circumstances [1]. Production systems may vary in terms of their complexity. Moreover, many current production companies have geographically separate production sites and factories are often located in different countries in which there are different labour costs which results in a different price per unit time of production. Moving production from one plant to another may be one way to reduce costs, that is, to increase profits. Manufacturing costs seem to be the most important factor but there are also others which managers must take into account. One of them is stability of the region where the manufacturing plant is located. The next one worth considering is reliability of the supply chain. It is also necessary to consider transport availability, distance from customers, and so on. As it is clear from the above and other contexts, a number of various indicators must be taken into account for complexity assessment of selected general process structures while designing the structure or optimising manufacturing tasks [2]. The structure of production processes also depends on the production needs of specific products that may show high variability. Organising production processes is closely related to the process maps and procedures responsible for manufacturing products from individual components [3]. A key prerequisite for the effectiveness of the above and other production systems is the precise definition of the interaction between the machining process and the machine tools [4]. Also, requirements grow for monitoring possible disruptions of production systems [5]. Additionally, parts and quick recovery of the production process in case of faults and other risks linked to the general input-output model which is a production system are to be considered [6]. Manufacturing of the product generally occurs as a series of individual actions that are performed manually, mechanically, or a combination of these. Optimisation requires continuously processed orders on individual projects. It can also be a serial production of one product in which you can easily define a set of key performance indicators and manage and automate production [7, 8]. Today, the standard starting point for the design and optimisation of manufacturing systems is simulation. Computer simulations allow you to test different variants of production quickly. It is possible to test many consequences of the changes in the production process and choose the most effective way of making orders in a short time [9]. Simulations can be used both before the draft design of the production system and for the purpose of optimising the production system and reengineering of production processes, respectively. In both cases it is necessary to treat simulation results as baseline data and information for designing or redesigning the considered system. In addition to defining the structure of production systems (in production and logistics systems especially of discreet nature, see, e.g., [10–12]) simulations are useful for planning production and its sustainability and continuity [13, 14]. Specifically, the simulation can help coordinate the needs of various departments and discovery and management bottlenecks and improve resource allocation, distribution of production between production lines or plants, testing strategies, performance measurement, and so on [15, 16]. Everything mentioned may result in lower production costs and increase efficiency ultimately. The basis for the simulation is mathematical models. Creating simulation mathematical models allows us to use a variety of methods and approaches. This could include a multiagents approach [17, 18], Petri nets [19], object-oriented approach [20], or many others. For the purposes of logistics and production systems, which are the main focus of this article, heuristic approaches can be effectively used. Additionally, it is possible to define a mathematical simulation model in the selected set of cases. Such a model allows us to obtain information for particular specific optimisation solutions (see, e.g., [21–23] or [24]). If there is a set of production lines, factories, and so on, it is also possible to use some of the theoretical background in the field of modular systems. The goal of every company is to make a profit and search for new markets and, at the same time, look for ways of minimising manufacturing costs. One of them is locating production in certain destinations where labour costs are considerably lower. Nevertheless, manufacturing capacities of companies can be limited to make products in time which results in placing production load in a more competitive location. Customers usually do not need all ready orders at once. Products they require are to be delivered to their logistic centers subsequently, for example, for further processing.Production systems have various structures; however, they are defined by certain common features. One of them is the tool replacement problem. Tools are replaced either individually or within replacement of the so-called tool stand. Usually, there is a tendency to replace only fully worn out tools. A problem which occurs in the discussed system is the need to replace the stand with tools even if the tools in it are not fully worn out. So far manufacturing problems of this type have been solved on condition that either fully worn out tools or the unnecessary ones are subject to replacement [25, 26].The main goal of this article is to define and simulate the mathematical model for the evaluation of the distribution of production in several plants within one complex company to achieve maximum production in the shortest possible time and then minimise costs of manufacturing. Individual companies may be geographically located in different countries with different labour costs and a production time unit. Individual companies are considered as autonomous systems with the same production possibilities. The model takes into account three variants consisting of 3, 4, or 5 companies which can make orders according to vacancies. To compare all possible variants, the mathematical methods of permutations without repetition are used. The basic criteria for the comparison of efficiencies of the production system as a whole are the time and cost of manufacturing time unit.Complexity has always been a part of each manufacturing environment. Therefore, there has always been a need to classify them as complex systems where numerous phenomena take place [27, 28]. The complexity of the selected system is described by its behaviour. All components interact in multiple ways and follow the rules which result from the specification and model of the system. The system is characterised by its interdependencies which are created step by step in accordance with a software engineering approach. Programming complexity is a measure of the interactions of the various elements of the software created for meeting the article objectives. The mutual interdependencies are regulated by the emerging need to make the order matrix elements at the given stages. The state of the discussed system emerges from a collection of preceding interactions of work stands. The system receives orders at random so it is never known in advance what kind of order customers require. Once the order is set, the whole course of calculations depending on each other should be initiated to deliver the solution to meet the stated criteria. These correlated relationships let us create a differentiated structure that can, as a system, interact with its subsystems which are placed in various locations. The organised aspect of this form of complexity emerges from the need to meet accepted criteria without any operator’s guidance at the decision-making level. This duty is taken over by heuristic algorithms. The number of machines does not have to be very large for a particular subsystem to have emergent properties. The system implements specified rules which can be invoked to explain the origin of complexity. Tools in stands which are subject to replacement are an important factor of complexity. The system is highly sensitive to initial conditions. The size of the input influences the level of complexity; that is, the state of the system is a function of the number of order matrix elements. In our case, complexity can be treated as a measure of the total number of correlations in each subsystem whose properties are understood as a state of the system. A complex system is defined by its different attributes and presents problems in both mathematical modelling and subsequent simulation testing. The study of the complex system investigates how relationships between tools in work stands and buffer stores, understood as interconnected components, give rise to the collective behaviours of the subsystems in the frame of the whole manufacturing system. The equations from which the model of the complex system is developed derive from information theory and represent organised but unpredictable behaviours of the manufacturing system that can be considered fundamentally complex. Simulation of company processes requires a thorough analytical approach. The method presented in this article is proposed for an automotive industry supplier. The output of the analysed global company is represented by various parts used during a car assembly process. The multinational company has its headquarters in the heart of Europe and, from there, customers’ orders are directed to dedicated plants for manufacturing. It is possible to adjust manufacturing procedures so that they can be the same in all plants. For comparison reasons it is assumed that all analysed plants have the same arrangements of machines and tools when required. This enables making any order matrix element in any available plant. It is assumed that quality issues are met in every plant of the system. The problem exists because the price of work differs as each macrologistic area is characterised by its autonomous labour costs. However, it is impossible to locate all production output in the plant which would make orders as cheap as possible as there are time constraints. Knowing the initial state of orders as well as time bounds for ordered products the search for the cheapest manufacturing arrangement is initiated. The approach emphasised in the article is an autonomous one as there are no general methods for optimising manufacturing tasks. The model of the system is significant as it eliminates excessive costs, allowing the operator of the system to distribute the orders to the plants whose configuration increases the profits of the global company by minimising the total manufacturing costs. The article focuses on the information approach to the simulation process of the logistic manufacturing system. This kind of approach results from software engineering which has led to creating the dedicated software to carry out required calculations leading to reaching the satisfactory solution.The proposed model represents one of the possible solutions for optimising production in case of dislocated companies which are at disposal. It is significant as it is possible to use it for a particular realistic case described by the defined structure and, of course, it can be treated as one of the scientific bases for solving similar examples (e.g., adaptation of the model for other structures, implementation of other decision-making algorithms, and expansion of other evaluation parameters, for example, from the set of key performance indicators (KPI) of the company).


## 2. Mathematical Model

Symbols used for logistic system modelling presented in this section are explained in Symbols shown at the end of the paper. They remain in accordance with the standards of mathematical models used for the description and simulation of logistic, production, trade, and other systems.It is assumed that manufacturing processes take place in the complex system which consists ofA subsystems. Each αth subsystem, α
=
1
,
…
,
A, carries out exactly the same production operations; however, their initial state may differ. Orders can be made in any αth manufacturing plant.The separate manufacturing plant has a serial form and consists of work stands assembled in sequence. The stands are equipped with tools which are subject to wear throughout the manufacturing process. When a tool in a stand is completely worn out, the manufacturing process is continued with the use of another tool in the same stand as long as either its life or the manufacturing route allows it. It is assumed that tools cannot be replaced separately. When all tools in the given stand are worn out or the manufacturing process cannot be continued through this stand, the discussed stand is subject to replacement. There are buffer stores between the work stands.The manufacturing plant described above can be multiplied which results in creating exactly the same manufacturing system in various locations. It is assumed thatM customer can order N types of products.Let us assume orders to be made are shown in the matrix of orders:(1)
Z
k
=
z
m
,
n
k
,
k
=
1
,
…
,
K
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,where z
m
,
n
k is the nth order of the mth customer at the kth stage.If thenth product cannot be made for the mth customer then z
m
,
n
k
=
-
1; otherwise z
m
,
n
k
≥
0.Products are made from various types of charges which leads to introducing the adjustment matrix of charges to products:(2)
Ω
=
ω
l
/
m
,
n
,
l
=
1
,
…
,
L
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,where ω
l
/
m
,
n is the adjustment of the nth order of the mth customer to the lth charge (the number of the charge element).The discussed manufacturing system takes the form shown in the matrix of structure:(3)
E
=
e
i
,
j
α
,
α
=
1
,
…
,
A
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where e
i
,
j
α is the ith tool in the jth work stand in the αth manufacturing plant.The route matrix is introduced:(4)
D
=
d
j
,
n
,
j
=
1
,
…
,
J
,
n
=
1
,
…
,
N
,where d
j
,
n is the number of the ith tool in the jth work stand used for making the nth type product.The base life matrix is introduced:(5)
G
=
g
i
,
j
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where g
i
,
j is the number of base elements of a product which can be made by the ith tool in the jth work stand before it becomes worn out.Let us associate the matrix of coefficients with the previous matrix of life:(6)
Ψ
=
ψ
m
,
n
/
i
,
j
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where ψ
m
,
n
/
i
,
j is the coefficient determining how many units of the nth type order for the mth customer can be made by the ith tool in the jth tool stand.At the same timeψ
m
,
n
/
i
,
j
≥
1 if thenth type product is made by the ith tool in the jth work stand; otherwise ψ
m
,
n
/
i
,
j
=
0.The base coefficient for the calculation purposeψ
0
=
1.The life matrix for thenth product of the mth customer takes the following form:(7)
G
=
g
m
,
n
/
i
,
j
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where g
m
,
n
/
i
,
j is the number of nth products for the mth customer elements which can be made by the ith tool in the jth work stand.At the same timeg
m
,
n
/
i
,
j
=
ψ
m
,
n
/
i
,
j
·
g
i
,
j, m
=
1
,
…
,
M, n
=
1
,
…
,
N, i
=
1
,
…
,
I, j
=
1
,
…
,
J.The structure vector of base capacity of buffer stores is introduced:(8)
B
=
b
j
α
,
α
=
1
,
…
,
A
,
j
=
1
,
…
,
J
-
1
,where b
j
α is the base capacity of the buffer store placed behind the jth tool stand in the αth manufacturing system. At the same time b
j
α
>
0 if the buffer is active; otherwise b
j
α
=
-
1.It is assumed that eachαth manufacturing plant has the same active structure of the buffer store system; however, their capacity may differ.Let us introduce the matrix of coefficients of the buffer stores:(9)
Ψ
b
=
ψ
j
,
n
α
,
α
=
1
,
…
,
A
,
j
=
1
,
…
,
J
-
1
,
n
=
1
,
…
,
N
,where ψ
j
,
n
α is the coefficient of the jth buffer store in case of storing the nth type product in the αth manufacturing system.The state of the buffer store is expressed as follows:(10)
B
k
=
b
α
/
j
k
,
α
=
1
,
…
,
A
,
j
=
1
,
…
,
J
-
1
,
k
=
1
,
…
,
K
,where b
α
/
j
k is the state of the jth buffer store in the αth manufacturing plant at the kth stage.The manufacturing system is always defined in its current state shown in the base matrix of state:(11)
S
k
=
s
α
i
,
j
k
,
α
=
1
,
…
,
A
,
k
=
1
,
…
,
K
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where s
α
i
,
j
k is the base state of the ith tool in the jth stand in the αth manufacturing system at the kth stage.The state of the system is recalculated and shown in the matrix of state:(12)
S
α
k
=
s
α
m
,
n
/
i
,
j
k
,
α
=
1
,
…
,
A
,
k
=
1
,
…
,
K
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,where s
α
m
,
n
/
i
,
j
k is the state of the ith tool in the jth stand in the αth manufacturing system in case of making the nth product for the mth customer at the kth stage. At the same time s
α
m
,
n
/
i
,
j
k
=
ψ
n
/
i
,
j
·
s
α
i
,
j
k.The base flow capacity of the manufacturing system is defined in the base matrix of flow capacity:(13)
P
k
=
p
α
i
,
j
k
,
α
=
1
,
…
,
A
,
k
=
1
,
…
,
K
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where p
α
i
,
j
k is the base capacity of the ith tool in the jth stand in the αth manufacturing system at the kth stage.The flow capacity of the system is recalculated and shown in the matrix of flow capacity:(14)
P
α
k
=
p
α
m
,
n
/
i
,
j
k
,
α
=
1
,
…
,
A
,
k
=
1
,
…
,
K
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,where p
α
m
,
n
/
i
,
j
k is the flow capacity of the ith tool in the jth stand in the αth manufacturing system in case of making the nth product for the mth customer at the kth stage. At the same time p
α
m
,
n
/
i
,
j
k
=
ψ
n
/
i
,
j
·
p
α
i
,
j
k.The flow capacity of theith tool in the jth stand in the αth manufacturing system in case of making the nth product for the mth customer at the kth stage is expressed as follows:(15)
p
α
m
,
n
/
i
,
j
k
=
ψ
m
,
n
/
i
,
j
·
g
i
,
j
-
ψ
m
,
n
/
i
,
j
·
s
α
m
,
n
/
i
,
j
k
.The matrix of manufacturing times takes the following form:(16)
T
p
r
=
τ
m
,
n
/
i
,
j
p
r
,
m
=
1
,
…
,
M
,
n
=
1
,
…
,
N
,
i
=
1
,
…
,
I
,
j
=
1
,
…
,
J
,where τ
m
,
n
/
i
,
j
p
r is the manufacturing time of one unit of the nth product for the mth customer by the ith tool of the jth work stand.The vector of replacement times takes the following form:(17)
T
r
e
p
l
=
τ
j
r
e
p
l
,
j
=
1
,
…
,
J
,where τ
j
r
e
p
l is the replacement time of tools in the jth work stand.Let us introduce the vector of unit time costs:(18)
C
U
T
C
=
c
α
,
α
=
1
,
…
,
A
,where c
α is the cost of one time unit of operating the αth plant.


### 2.1. Equations of State

The state of the complex manufacturing system changes after either any decision concerning producing anynth product for the mth customer in any αth manufacturing plant or replacing any jth stand in the αth manufacturing plant: (19)
S
α
0
⟶
⋯
⟶
S
α
k
⟶
⋯
⟶
S
α
K
.The state of theith tool in the jth stand in case of making the nth product for the mth customer changes consequently throughout the manufacturing course:(20)
s
α
m
,
n
/
i
,
j
0
⟶
⋯
⟶
s
α
m
,
n
/
i
,
j
k
⟶
⋯
⟶
s
α
m
,
n
/
i
,
j
K
,which can be written in the following form:(21)
s
α
m
,
n
/
i
,
j
k
=
s
α
m
,
n
/
i
,
j
k
-
1
in  case  of  not  making  the
n
-
t
h
product  for  the
m
-
t
h
customer  by  the
i
-
t
h
tool
in  the
j
-
t
h
stand  in  the
α
-
t
h
manufacturing  system  at  the
k
-
t
h
stage
,
s
α
m
,
n
/
i
,
j
k
-
1
+
x
α
m
,
n
/
i
,
j
k
otherwise
,where x
α
m
,
n
/
i
,
j
k is the amount of the nth product for the mth customer made by the ith tool in the jth stand in the αth manufacturing system at the kth stage.The state of the baseith tool in case of replacement the jth stand changes as follows:(22)
s
α
i
,
j
k
=
s
α
i
,
j
k
-
1
if  the
j
-
t
h
stand  is  replaced
,
0
otherwise
.The order matrixZ
k changes after every decision concerning production activity:(23)
Z
0
⟶
Z
1
⟶
⋯
⟶
Z
k
⟶
⋯
⟶
Z
K
.The order matrix is modified after every decision about production:(24)
z
m
,
n
k
=
z
m
,
n
k
-
1
-
x
m
,
n
k
in  case  of  making  the
n
-
t
h
product  for  the
m
-
t
h
customer  at  the
k
-
t
h
stage
,
z
m
,
n
k
-
1
otherwise
,where x
m
,
n
k is the number of units of the nth product for the mth customer made at the kth stage.


### 2.2. Control Algorithms

There is a need to seek satisfactory solutions by making orders in various locations as they generate various manufacturing costs. Comparing costs allows us to determine where thenth order should be manufactured to minimise production costs. In order to control the course of manufacturing there is also a need to introduce sample heuristic algorithms. First of all, it is necessary to determine the αth manufacturing plant to place an order in. Secondly, the nth product for the mth customer to be made is to be chosen. The flow capacity means how many elements of the order matrix can be passed through the manufacturing plant before production capabilities of the subsystem are used up. First of all, the operator of the system is obliged to choose the αth plant, α
=
1
,
…
,
A. For example, if the algorithm of the minimal flow capacity of the production plant is set it means that a plant which can make the fewest number of products is required; then the search for the αth plant meeting this condition is initiated. Having detected such a plant, the algorithm of the maximal order is implemented which means that the biggest order to be made through the available route in the αth plant is required. Such an approach is explained in detail in [21, 29].


#### 2.2.1. The Algorithm of the Maximal Flow Capacity of the Production Plant

This algorithm chooses theαth manufacturing plant on condition that it is characterised by the maximal coefficient of flow capacity ξ
α
k
=
∑
i
=
1
I
∑
j
=
1
J
p
α
m
,
n
/
i
,
j
k. To determine the λth manufacturing plant where 1
≤
λ
≤
A condition (25) must be met:(25)
q
α
_
m
a
x
k
=
ξ
λ
k
⟺
ξ
λ
k
=
max
1
≤
α
≤
A
⁡
ξ
α
k
.


#### 2.2.2. The Algorithm of the Minimal Flow Capacity of the Production Plant

This algorithm chooses theαth manufacturing plant on condition that it is characterised by the minimal coefficient of flow capacity ξ
α
k
=
∑
i
=
1
I
∑
j
=
1
J
p
α
m
,
n
/
i
,
j
k. To determine the λth plant where 1
≤
λ
≤
A condition (26) must be met:(26)
q
α
_
m
i
n
k
=
ξ
λ
k
⟺
ξ
λ
k
=
min
1
≤
α
≤
A
⁡
ξ
α
k
.


#### 2.2.3. The Algorithm of the Maximal Order

This algorithm chooses the order matrix element characterised by the maximal value ofγ
m
,
n
k. To produce the order z
μ
,
η
k, 1
≤
μ
≤
M, 1
≤
η
≤
N, the following condition must be met where γ
m
,
n
k
=
z
m
,
n
k:(27)
q
z
_
m
a
x
k
=
z
μ
,
η
k
⟺
γ
μ
,
η
k
=
max
1
≤
m
≤
M
1
≤
n
≤
N
⁡
γ
m
,
n
k
.


#### 2.2.4. The Algorithm of the Minimal Order

This algorithm chooses the order matrix element characterised by the minimal valueγ
m
,
n
k. To produce the order z
μ
,
η
k, 1
≤
μ
≤
M, 1
≤
η
≤
N, the following condition must be met where γ
m
,
n
k
=
z
m
,
n
k:(28)
q
z
_
m
i
n
k
=
z
μ
,
η
k
⟺
γ
μ
,
η
k
=
min
1
≤
m
≤
M
1
≤
n
≤
N
⁡
γ
m
,
n
k
.


### 2.3. Manufacturing Strategies

In order to make orders in theαth subsystem, the following strategies are proposed:(i)
The immediate strategy: a new order is introduced into the manufacturing system as soon as such a possibility emerges.
(ii)
The delayed strategy: a new order is introduced into the manufacturing system only then when the preceding one leaves the system.


### 2.4. Criteria

There are a few criteria to be taken into account; however, the most decisive one in terms of manufacturing under time pressure seems to be the minimal manufacturing time criterion so it is chosen for further consideration. As orders are made in various plants there are corresponding aspects of this problem to be analysed. One of them is a different location of each plant which is connected with different manufacturing costs. It is assumed that each manufacturing process is carried out in accordance with the two-stage criteria specified below. First of all, the criterion of minimising the manufacturing time is introduced:(29)
Q
T
=
∑
α
=
1
A
∑
k
=
1
K
∑
i
=
1
I
∑
j
=
1
J
y
′
α
i
,
j
k
·
τ
m
,
n
/
i
,
j
p
r
⟶
m
i
n
,where(30)
y
′
α
i
,
j
k
=
1
if  the
i
-
t
h
tool  in  the
j
-
t
h
stand  in  the
α
-
t
h
manufacturing  plant
is  implemented  in  the  manufacturing  process  at  the
k
-
t
h
stage
,
0
otherwise
.Having generated the best solution from the point of view of minimising time, there is a need to minimise manufacturing costs by means of the criterion of minimising manufacturing costs:(31)
Q
C
=
∑
α
=
1
A
c
α
⟶
m
i
n
.


## 2.1. Equations of State

The state of the complex manufacturing system changes after either any decision concerning producing anynth product for the mth customer in any αth manufacturing plant or replacing any jth stand in the αth manufacturing plant: (19)
S
α
0
⟶
⋯
⟶
S
α
k
⟶
⋯
⟶
S
α
K
.The state of theith tool in the jth stand in case of making the nth product for the mth customer changes consequently throughout the manufacturing course:(20)
s
α
m
,
n
/
i
,
j
0
⟶
⋯
⟶
s
α
m
,
n
/
i
,
j
k
⟶
⋯
⟶
s
α
m
,
n
/
i
,
j
K
,which can be written in the following form:(21)
s
α
m
,
n
/
i
,
j
k
=
s
α
m
,
n
/
i
,
j
k
-
1
in  case  of  not  making  the
n
-
t
h
product  for  the
m
-
t
h
customer  by  the
i
-
t
h
tool
in  the
j
-
t
h
stand  in  the
α
-
t
h
manufacturing  system  at  the
k
-
t
h
stage
,
s
α
m
,
n
/
i
,
j
k
-
1
+
x
α
m
,
n
/
i
,
j
k
otherwise
,where x
α
m
,
n
/
i
,
j
k is the amount of the nth product for the mth customer made by the ith tool in the jth stand in the αth manufacturing system at the kth stage.The state of the baseith tool in case of replacement the jth stand changes as follows:(22)
s
α
i
,
j
k
=
s
α
i
,
j
k
-
1
if  the
j
-
t
h
stand  is  replaced
,
0
otherwise
.The order matrixZ
k changes after every decision concerning production activity:(23)
Z
0
⟶
Z
1
⟶
⋯
⟶
Z
k
⟶
⋯
⟶
Z
K
.The order matrix is modified after every decision about production:(24)
z
m
,
n
k
=
z
m
,
n
k
-
1
-
x
m
,
n
k
in  case  of  making  the
n
-
t
h
product  for  the
m
-
t
h
customer  at  the
k
-
t
h
stage
,
z
m
,
n
k
-
1
otherwise
,where x
m
,
n
k is the number of units of the nth product for the mth customer made at the kth stage.


## 2.2. Control Algorithms

There is a need to seek satisfactory solutions by making orders in various locations as they generate various manufacturing costs. Comparing costs allows us to determine where thenth order should be manufactured to minimise production costs. In order to control the course of manufacturing there is also a need to introduce sample heuristic algorithms. First of all, it is necessary to determine the αth manufacturing plant to place an order in. Secondly, the nth product for the mth customer to be made is to be chosen. The flow capacity means how many elements of the order matrix can be passed through the manufacturing plant before production capabilities of the subsystem are used up. First of all, the operator of the system is obliged to choose the αth plant, α
=
1
,
…
,
A. For example, if the algorithm of the minimal flow capacity of the production plant is set it means that a plant which can make the fewest number of products is required; then the search for the αth plant meeting this condition is initiated. Having detected such a plant, the algorithm of the maximal order is implemented which means that the biggest order to be made through the available route in the αth plant is required. Such an approach is explained in detail in [21, 29].


### 2.2.1. The Algorithm of the Maximal Flow Capacity of the Production Plant

This algorithm chooses theαth manufacturing plant on condition that it is characterised by the maximal coefficient of flow capacity ξ
α
k
=
∑
i
=
1
I
∑
j
=
1
J
p
α
m
,
n
/
i
,
j
k. To determine the λth manufacturing plant where 1
≤
λ
≤
A condition (25) must be met:(25)
q
α
_
m
a
x
k
=
ξ
λ
k
⟺
ξ
λ
k
=
max
1
≤
α
≤
A
⁡
ξ
α
k
.


### 2.2.2. The Algorithm of the Minimal Flow Capacity of the Production Plant

This algorithm chooses theαth manufacturing plant on condition that it is characterised by the minimal coefficient of flow capacity ξ
α
k
=
∑
i
=
1
I
∑
j
=
1
J
p
α
m
,
n
/
i
,
j
k. To determine the λth plant where 1
≤
λ
≤
A condition (26) must be met:(26)
q
α
_
m
i
n
k
=
ξ
λ
k
⟺
ξ
λ
k
=
min
1
≤
α
≤
A
⁡
ξ
α
k
.


### 2.2.3. The Algorithm of the Maximal Order

This algorithm chooses the order matrix element characterised by the maximal value ofγ
m
,
n
k. To produce the order z
μ
,
η
k, 1
≤
μ
≤
M, 1
≤
η
≤
N, the following condition must be met where γ
m
,
n
k
=
z
m
,
n
k:(27)
q
z
_
m
a
x
k
=
z
μ
,
η
k
⟺
γ
μ
,
η
k
=
max
1
≤
m
≤
M
1
≤
n
≤
N
⁡
γ
m
,
n
k
.


### 2.2.4. The Algorithm of the Minimal Order

This algorithm chooses the order matrix element characterised by the minimal valueγ
m
,
n
k. To produce the order z
μ
,
η
k, 1
≤
μ
≤
M, 1
≤
η
≤
N, the following condition must be met where γ
m
,
n
k
=
z
m
,
n
k:(28)
q
z
_
m
i
n
k
=
z
μ
,
η
k
⟺
γ
μ
,
η
k
=
min
1
≤
m
≤
M
1
≤
n
≤
N
⁡
γ
m
,
n
k
.


## 2.2.1. The Algorithm of the Maximal Flow Capacity of the Production Plant

This algorithm chooses theαth manufacturing plant on condition that it is characterised by the maximal coefficient of flow capacity ξ
α
k
=
∑
i
=
1
I
∑
j
=
1
J
p
α
m
,
n
/
i
,
j
k. To determine the λth manufacturing plant where 1
≤
λ
≤
A condition (25) must be met:(25)
q
α
_
m
a
x
k
=
ξ
λ
k
⟺
ξ
λ
k
=
max
1
≤
α
≤
A
⁡
ξ
α
k
.


## 2.2.2. The Algorithm of the Minimal Flow Capacity of the Production Plant

This algorithm chooses theαth manufacturing plant on condition that it is characterised by the minimal coefficient of flow capacity ξ
α
k
=
∑
i
=
1
I
∑
j
=
1
J
p
α
m
,
n
/
i
,
j
k. To determine the λth plant where 1
≤
λ
≤
A condition (26) must be met:(26)
q
α
_
m
i
n
k
=
ξ
λ
k
⟺
ξ
λ
k
=
min
1
≤
α
≤
A
⁡
ξ
α
k
.


## 2.2.3. The Algorithm of the Maximal Order

This algorithm chooses the order matrix element characterised by the maximal value ofγ
m
,
n
k. To produce the order z
μ
,
η
k, 1
≤
μ
≤
M, 1
≤
η
≤
N, the following condition must be met where γ
m
,
n
k
=
z
m
,
n
k:(27)
q
z
_
m
a
x
k
=
z
μ
,
η
k
⟺
γ
μ
,
η
k
=
max
1
≤
m
≤
M
1
≤
n
≤
N
⁡
γ
m
,
n
k
.


## 2.2.4. The Algorithm of the Minimal Order

This algorithm chooses the order matrix element characterised by the minimal valueγ
m
,
n
k. To produce the order z
μ
,
η
k, 1
≤
μ
≤
M, 1
≤
η
≤
N, the following condition must be met where γ
m
,
n
k
=
z
m
,
n
k:(28)
q
z
_
m
i
n
k
=
z
μ
,
η
k
⟺
γ
μ
,
η
k
=
min
1
≤
m
≤
M
1
≤
n
≤
N
⁡
γ
m
,
n
k
.


## 2.3. Manufacturing Strategies

In order to make orders in theαth subsystem, the following strategies are proposed:(i)
The immediate strategy: a new order is introduced into the manufacturing system as soon as such a possibility emerges.
(ii)
The delayed strategy: a new order is introduced into the manufacturing system only then when the preceding one leaves the system.


## 2.4. Criteria

There are a few criteria to be taken into account; however, the most decisive one in terms of manufacturing under time pressure seems to be the minimal manufacturing time criterion so it is chosen for further consideration. As orders are made in various plants there are corresponding aspects of this problem to be analysed. One of them is a different location of each plant which is connected with different manufacturing costs. It is assumed that each manufacturing process is carried out in accordance with the two-stage criteria specified below. First of all, the criterion of minimising the manufacturing time is introduced:(29)
Q
T
=
∑
α
=
1
A
∑
k
=
1
K
∑
i
=
1
I
∑
j
=
1
J
y
′
α
i
,
j
k
·
τ
m
,
n
/
i
,
j
p
r
⟶
m
i
n
,where(30)
y
′
α
i
,
j
k
=
1
if  the
i
-
t
h
tool  in  the
j
-
t
h
stand  in  the
α
-
t
h
manufacturing  plant
is  implemented  in  the  manufacturing  process  at  the
k
-
t
h
stage
,
0
otherwise
.Having generated the best solution from the point of view of minimising time, there is a need to minimise manufacturing costs by means of the criterion of minimising manufacturing costs:(31)
Q
C
=
∑
α
=
1
A
c
α
⟶
m
i
n
.


## 3. Case Study

In order to verify correctness of the assumptions presented in the paper hereby it is necessary to carry out the simulation process with the use of sample data. Apart from obtaining results concerning the minimal manufacturing time it is possible to present other associating results for each simulation process, that is, total replacement time of tools in work stands, lost flow capacity of tools due to premature replacement, and remaining capacity of tools in case of completing making the whole order.The following general assumptions for the case study are taken into account:(i)
All available manufacturing plants are at the same initial state as follows:(32)
∃
1
≤
α
≤
A
S
α
0
=
S
0
.
(ii)
There is enough charge material for making the whole order matrix elements.The simulator used for simulating making order receives data drawn at random from a specified range:(33)
Z
0
=
24
32
50
51
29
39
24
33
28
33
46
47
48
33
39
46
43
51
30
26
37
43
48
44
49
;
G
=
5
9
9
6
6
10
9
7
9
10
8
6
6
9
6
;
S
0
=
0
4
6
1
0
7
6
3
7
6
1
5
2
6
0
;
Ψ
=
1
3
2
1
3
1
3
1
2
1
3
3
3
3
3
3
2
2
3
3
2
1
2
1
2
;
Ψ
b
=
4
5
2
5
4
2
2
2
5
3
5
4
5
2
3
3
2
4
4
2
2
1
2
5
2
;
Ω
=
2
2
2
1
1
2
2
2
2
1
2
2
2
1
1
1
1
2
1
2
2
1
2
2
2
;
D
=
1
1
2
3
1
⋮
1
3
3
1
1
⋮
3
1
1
1
3
⋮
3
2
1
1
3
⋮
2
2
1
2
3
3
3
3
2
1
⋮
2
2
2
2
3
⋮
3
3
3
3
2
⋮
2
1
3
2
2
⋮
2
2
1
2
3
1
1
3
3
1
⋮
1
1
3
3
3
⋮
1
3
1
3
1
⋮
2
1
2
1
2
⋮
2
1
3
2
3
1
1
1
2
1
⋮
3
3
3
3
3
⋮
3
2
1
1
1
⋮
2
2
2
3
3
⋮
2
2
1
3
2
1
2
3
1
2
⋮
2
2
1
3
3
⋮
3
2
2
2
2
⋮
2
3
1
3
1
⋮
3
2
1
2
1
;
T
p
r
=
5
3
5
4
5
⋮
4
5
4
3
4
⋮
3
4
5
3
4
⋮
4
3
4
4
4
⋮
4
5
5
3
5
4
3
5
4
4
⋮
5
5
3
3
3
⋮
4
5
3
3
3
⋮
5
3
4
5
4
⋮
5
3
5
4
5
3
5
4
5
4
⋮
4
3
4
5
4
⋮
4
3
3
3
5
⋮
5
5
4
3
3
⋮
5
5
3
4
5
3
5
3
5
5
⋮
4
3
4
4
3
⋮
3
4
4
4
3
⋮
3
4
4
4
3
⋮
3
5
3
3
5
4
5
3
4
5
⋮
4
4
3
3
5
⋮
5
3
3
4
4
⋮
5
5
4
3
3
⋮
5
3
4
5
5
;
T
r
e
p
l
=
9
8
8
8
8
7
9
7
9
9
7
9
9
9
7
;
B
=
-
1
-
1
-
1
0
;
C
U
T
C
=
5
6
4
7
8
.The simulator implemented for processing the data either generates them at random or accepts them from the file or the operator of the system introduces them manually. It is possible to alternate data if necessary. In our case the data are obtained from the ready file which was subject to thorough verification [26]. Figure 1 presents the sample way of introducing initial data for the subsequent simulation process.Figure 1
Sample initial data introduction forα
=
1, m
=
1, and n
=
1.The data in Figure1 are subject to the subsequent simulation procedure which generates results shown in Table 1. The main criterion remains the minimal manufacturing time; however, results of the total replacement time, the lost flow capacity, and the remaining capacity are given for comparison reasons. First of all, the strategies of immediate manufacturing and delayed manufacturing are employed; then the algorithm of the maximal flow capacity of the αth production plant q
α
_
m
a
x
k (max_flow) and the algorithm of the minimal flow capacity of the αth production plant q
α
_
m
i
n
k (min_flow) are introduced. Finally, the algorithm of the maximal order q
z
_
m
a
x
k (max_order) and the algorithm of the minimal order q
z
_
m
i
n
k (min_flow) are introduced. Additionally, results of the 1000 simulations for both manufacturing strategies are presented. The input conditions are the same for simulation experiments in case of the system consisting of either 3 or 4 or 5 manufacturing plants which are subject to the subsequent thorough analysis.Table 1
Results of simulation experiments.
Number of plants
Criterion
Immediate manufacturing
Delayed manufacturing
max_order max_flow
max_order min_flow
min_order max_flow
min_order min_flow
1000 sim
max_order max_flow
max_order min_flow
min_order max_flow
min_order min_flow
1000 sim
3
Total manufacturing time
2045
2045
2140
2140
1997
2196
2196
2223
2223
2124
Total replacement time
1487
1487
1576
1576
1395
1392
1392
1503
1503
1309
Lost flow capacity
7,00
7,00
4,50
4,50
9,83
7,17
7,17
4,50
4,50
1,50
Remaining capacity
185,33
185,33
207,83
207,83
133,83
189,17
189,17
207,83
207,83
130,50
4
Total manufacturing time
1553
1553
1613
1613
1509
1648
1648
1704
1704
1609
Total replacement time
1286
1286
1337
1337
1163
1236
1236
1338
1338
1119
Lost flow capacity
6,17
6,17
5,67
5,67
0,83
8,17
8,17
5,67
5,67
1,17
Remaining capacity
258,17
258,17
251,67
251,67
192,00
282,17
282,17
251,67
251,67
193,83
5
Total manufacturing time
1320
1317
1326
1358
1242
1381
1373
1390
1416
1308
Total replacement time
1129
1151
1137
1159
1005
1163
1159
1158
1172
1003
Lost flow capacity
7,50
8,00
5,83
7,00
0,33
7,17
6,33
6,83
6,83
1,50
Remaining capacity
303,83
354,33
278,50
293,33
239,83
318,17
332
296,5
308,50
240,00In the case of the three-plant system the total minimal manufacturing time (1997 time units) is obtained by means of carrying out 1000 simulations with the use of the so-called immediate strategy; however, it does not guarantee achieving the lowest value of the total replacement time as well as the lowest value of the lost flow capacity and the highest value of the remaining capacity.In the case of the four-plant system the total minimal manufacturing time (1509 time units) is also obtained by means of carrying out 1000 simulations with the use of the so-called immediate strategy. This time, it achieves the lowest value of the total replacement time as well as the lowest value of the lost flow capacity. Unfortunately, it delivers the worst value of the remaining capacity.In the case of the five-plant system the total minimal manufacturing time (1242 time units) is again obtained by means of carrying out 1000 simulations with the use of the immediate strategy. It also reaches the lowest value of the total replacement time as well as the lowest value of the lost flow capacity. Again, it delivers the worst value of the remaining capacity. In conclusion, all best results are obtained by means of the immediate manufacturing strategy.Let us assume that the results shown in Table2 enable us to take the total minimal manufacturing times for granted in each manufacturing system, that is, consisting of 3, 4, and 5 available plants on the condition that they are to be used simultaneously. The total minimal manufacturing time in each system consisting of A subsystems is the longest time in the αth subsystem belonging to this system according to the table of results.Table 2
Manufacturing times in autonomous systems.
α
System
3 plants
4 plants
5 plants
1
1968
1466
1242
2
1997
1489
1242
3
1957
1498
1196
4
×
1509
1235
5
×
×
1168
Total manufacturing time in the system
1997
1509
1242The times shown in Table2 represent sequences of making orders in each αth plant. The sequences were obtained by means of simulation processes carried out for the data of this case study. Each result of the simulation process generates the best sequence of orders made in the separate plants of each system. For illustration reasons Table 3 shows time scheduling in case of implementing the time minimisation criterion for the 5-plant system. It forms the basis for further analysis.Table 3
Time scheduling in case of implementing the time minimisation criterion.
Order number
z
1,1
0
z
1,2
0
z
1,3
0
z
1,4
0
z
1,5
0
Plant number
1
5
3
4
4
Start
119
442
0
813
0
End
353
640
363
1235
161
Order number
z
2,1
0
z
2,2
0
z
2,3
0
z
2,4
0
z
2,5
0
Plant number
2
5
2
1
4
Start
900
0
624
540
462
End
1242
134
917
722
698
Order number
z
3,1
0
z
3,2
0
z
3,3
0
z
3,4
0
z
3,5
0
Plant number
3
5
1
3
1
Start
733
901
708
344
336
End
996
1168
970
503
554
Order number
z
4,1
0
z
4,2
0
z
4,3
0
z
4,4
0
z
4,5
0
Plant number
3
5
2
1
4
Start
979
622
0
0
675
End
1196
922
334
134
828
Order number
z
5,1
0
z
5,2
0
z
5,3
0
z
5,4
0
z
5,5
0
Plant number
3
2
4
1
5
Start
488
319
144
909
120
End
751
650
479
1242
469The sequences for minimising the total manufacturing time are given in Table4 and, at the same time, they are abbreviated to the adequate shortcuts where ρ
A
β is the βth sequence in the system consisting of A identical plants (it must be emphasised that for the needs of the case study the initial state is the same for each αth subsystem).Table 4
Sequences leading to minimisation the total manufacturing time.
Number of plant
Sequence in the 3-plant system
Production time
1
ρ
3
1
=
z
5,1
k
z
3,3
k
z
1,3
k
z
5,4
k
z
4,4
k
z
2,4
k
z
3,5
k
z
1,5
k
z
2,2
k
1968
2
ρ
3
2
=
z
4,5
k
z
1,4
k
z
1,2
k
z
5,3
k
z
4,1
k
z
3,2
k
z
4,2
k
z
2,1
k
1997
3
ρ
3
3
=
z
5,2
k
z
3,1
k
z
2,5
k
z
4,3
k
z
5,5
k
z
1,1
k
z
2,3
k
z
3,4
k
1957
Number of plant
Sequence in the 4-plant system
Production time
1
ρ
4
1
=
z
2,2
k
z
4,1
k
z
1,2
k
z
3,4
k
z
1,1
k
z
1,5
k
z
4,4
k
z
2,3
k
1466
2
ρ
4
2
=
z
3,2
k
z
2,4
k
z
4,2
k
z
4,3
k
z
5,4
k
z
4,5
k
1489
3
ρ
4
3
=
z
3,3
k
z
1,4
k
z
3,1
k
z
5,2
k
z
5,1
k
z
3,5
k
1498
4
ρ
4
4
=
z
5,5
k
z
5,3
k
z
2,5
k
z
2,1
k
z
1,3
k
1509
Number of plant
Sequence in the 5-plant system
Production time
1
ρ
5
1
=
z
4,4
k
z
1,1
k
z
3,5
k
z
2,4
k
z
3,3
k
z
5,4
k
1242
2
ρ
5
2
=
z
4,3
k
z
5,2
k
z
2,3
k
z
2,1
k
1242
3
ρ
5
3
=
z
1,3
k
z
3,4
k
z
5,1
k
z
3,1
k
z
4,1
k
1196
4
ρ
5
4
=
z
1,5
k
z
5,3
k
z
2,5
k
z
4,5
k
z
1,4
k
1235
5
ρ
5
5
=
z
2,2
k
z
5,5
k
z
1,2
k
z
4,2
k
z
3,2
k
1168The basis for improving the sample time scheduling approach is the minimal total manufacturing time obtained by means of implementing the immediate manufacturing strategy: 1997 for the 3-plant system, 1509 for the 4-plant system, and 1242 for the 5-plant system (see Table1). The results for the 5-plant system are shown graphically as a result of the simulation process (Figure 2).Figure 2
Results of the simulation process forA
=
5.The simulation results are associated with system plants; however, it is possible to move the manufacturing process to any other plant in the system as they perform the same production operations. Following this kind of reasoning it was assumed that it is possible to transfer the sequence of orders adjusted to a certain plant on the basis of the simulation results to any other plant in the discussed system. To carry out this process it is necessary to implement permutation without repetitions in order to find the solution which can minimise manufacturing costs to meet the criterion of minimising costs. It became possible only by comparing the results obtained by the method using the permutations without repetitions. In case of 3 plants there are3
!
=
6 possible solutions (see Table 5), 4 plants generate 4
!
=
24 possible solutions (see Table 6), and, finally, 5 plants deliver 5
!
=
120 possible solutions (see Table 7).Table 5
Manufacturing costs in the three-plant system (all data).
Plant
Unit cost
Combination number of production sequences
1
2
3
4
5
6
1
5
ρ
3
1
9840
ρ
3
1
9840
ρ
3
2
9985
ρ
3
2
9985
ρ
3
3
9785
ρ
3
3
9785
2
6
ρ
3
2
11982
ρ
3
3
11742
ρ
3
1
11808
ρ
3
3
11742
ρ
3
1
11808
ρ
3
2
11982
3
4
ρ
3
3
7828
ρ
3
2
7988
ρ
3
3
7828
ρ
3
1
7872
ρ
3
2
7988
ρ
3
1
7872
Total costs
29650
29570
29621
29599
29581
29639Table 6
Manufacturing costs in the four-plant system (all data).
Plant
Unit cost
Combination number of production sequences
1
2
3
4
5
6
1
5
ρ
4
1
7330
ρ
4
1
7330
ρ
4
1
7330
ρ
4
1
7330
ρ
4
1
7330
ρ
4
1
7330
2
6
ρ
4
2
8934
ρ
4
2
8934
ρ
4
3
8988
ρ
4
3
8988
ρ
4
4
9054
ρ
4
4
9054
3
4
ρ
4
3
5992
ρ
4
4
6036
ρ
4
4
6036
ρ
4
2
5956
ρ
4
2
5956
ρ
4
3
5992
4
7
ρ
4
4
10563
ρ
4
3
10486
ρ
4
2
10423
ρ
4
4
10563
ρ
4
3
10486
ρ
4
2
10423
Total costs
32819
32786
32777
32837
32826
32799
Plant
Unit cost
Combination number of production sequences
7
8
9
10
11
12
1
5
ρ
4
2
7445
ρ
4
2
7445
ρ
4
2
7445
ρ
4
2
7445
ρ
4
2
7445
ρ
4
2
7445
2
6
ρ
4
3
8988
ρ
4
3
8988
ρ
4
4
9054
ρ
4
4
9054
ρ
4
1
8796
ρ
4
1
8796
3
4
ρ
4
4
6036
ρ
4
1
5864
ρ
4
1
5864
ρ
4
3
5992
ρ
4
3
5992
ρ
4
4
6036
4
7
ρ
4
1
10262
ρ
4
4
10563
ρ
4
3
10486
ρ
4
1
10262
ρ
4
4
10563
ρ
4
3
10486
Total costs
32731
32860
32849
32753
32796
32763
Plant
Unit cost
Combination number of production sequences
13
14
15
16
17
18
1
5
ρ
4
3
7490
ρ
4
3
7490
ρ
4
3
7490
ρ
4
3
7490
ρ
4
3
7490
ρ
4
3
7490
2
6
ρ
4
4
9054
ρ
4
4
9054
ρ
4
1
8796
ρ
4
1
8796
ρ
4
2
8934
ρ
4
2
8934
3
4
ρ
4
1
5864
ρ
4
2
5956
ρ
4
2
5956
ρ
4
4
6036
ρ
4
4
6036
ρ
4
1
5864
4
7
ρ
4
2
10423
ρ
4
1
10262
ρ
4
4
10563
ρ
4
2
10423
ρ
4
1
10262
ρ
4
4
10563
Total costs
32831
32762
32805
32745
32722
32851
Plant
Unit cost
Combination number of production sequences
19
20
21
22
23
24
1
5
ρ
4
4
7545
ρ
4
4
7545
ρ
4
4
7545
ρ
4
4
7545
ρ
4
4
7545
ρ
4
4
7545
2
6
ρ
4
1
8796
ρ
4
1
8796
ρ
4
2
8934
ρ
4
2
8934
ρ
4
3
8988
ρ
4
3
8988
3
4
ρ
4
2
5956
ρ
4
3
5992
ρ
4
3
5992
ρ
4
1
5864
ρ
4
1
5864
ρ
4
2
5956
4
7
ρ
4
3
10486
ρ
4
2
10423
ρ
4
1
10262
ρ
4
3
10486
ρ
4
2
10423
ρ
4
1
10262
Total costs
32783
32756
32733
32829
32820
32751Table 7
Manufacturing costs in the five-plant system (chosen data).
Plant
Unit cost
Combination number of production sequences
11
12
13
14
15
16
1
5
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
2
6
ρ
5
3
7176
ρ
5
3
7176
ρ
5
4
7410
ρ
5
4
7410
ρ
5
4
7410
ρ
5
4
7410
3
4
ρ
5
2
4968
ρ
5
2
4968
ρ
5
5
4672
ρ
5
5
4672
ρ
5
2
4968
ρ
5
2
4968
4
7
ρ
5
4
8645
ρ
5
5
8176
ρ
5
2
8694
ρ
5
3
8372
ρ
5
3
8372
ρ
5
5
8176
5
8
ρ
5
5
9344
ρ
5
4
9880
ρ
5
3
9568
ρ
5
2
9936
ρ
5
5
9344
ρ
5
3
9568
Total costs
36343
36410
36554
36600
36304
36332
Plant
Unit cost
Combination number of production sequences
17
18
19
20
21
33
1
5
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
ρ
5
1
6210
ρ
5
2
6210
2
6
ρ
5
4
7410
ρ
5
4
7410
ρ
5
5
7008
ρ
5
5
7008
ρ
5
5
7008
ρ
5
4
7410
3
4
ρ
5
3
4784
ρ
5
3
4784
ρ
5
2
4968
ρ
5
2
4968
ρ
5
3
4784
ρ
5
1
4968
4
7
ρ
5
5
8176
ρ
5
2
8694
ρ
5
3
8372
ρ
5
4
8645
ρ
5
4
8645
ρ
5
3
8372
5
8
ρ
5
2
9936
ρ
5
5
9344
ρ
5
4
9880
ρ
5
3
9568
ρ
5
2
9936
ρ
5
5
9344
Total costs
36516
36442
36438
36399
36583
36304In the 3-plant system total manufacturing costs are minimised in the case of the combination of production sequence number 2 by 80 monetary units comparing them with the best result for 1000 simulations (see Table1).In the 4-plant system total manufacturing costs are minimised in the case of the combination of production sequence number 17 by 97 monetary units comparing them with the best result for 1000 simulations (see Table1).On the basis of comparison results shown in Table7, the course of the manufacturing process in the five-plant system was illustrated. Total manufacturing costs are minimised in the case of the combinations of production sequence numbers 15 and 33 which are the best in terms of seeking the minimal costs of making orders. As seen in Table 7, implementing these two combinations resulting from searching for the solution to minimise the total manufacturing costs lowers them by 131 monetary units comparing them with the best result for 1000 simulations (see Table 1). Finding the time minimising combinations numbers 15 and 33 enables us to adjust the best sequence of orders to the plants which minimise the summarised manufacturing time shown in Table 8.Table 8
Manufacturing costs in case of the immediate strategy in the 5-plant system.
Plant number
Production sequence
End time
Unit cost
Total costs
Best results for 1000 simulations
1
z
4,4
0
z
1,1
0
z
3,5
0
z
2,4
0
z
3,3
0
z
5,4
0
1242
5
6210
2
z
4,3
0
z
5,2
0
z
2,3
0
z
2,1
0
1242
6
7452
3
z
1,3
0
z
3,4
0
z
5,1
0
z
3,1
0
z
4,1
0
1196
4
4784
4
z
1,5
0
z
5,3
0
z
2,5
0
z
4,5
0
z
1,4
0
1235
7
8645
5
z
2,2
0
z
5,5
0
z
1,2
0
z
4,2
0
z
3,2
0
1168
8
9344
Total manufacturing costs
36435
Permutations without repetitions, combination 15
1
z
4,4
0
z
1,1
0
z
3,5
0
z
2,4
0
z
3,3
0
z
5,4
0
1242
5
6210
2
z
1,5
0
z
5,3
0
z
2,5
0
z
4,5
0
z
1,4
0
1235
6
7410
3
z
4,3
0
z
5,2
0
z
2,3
0
z
2,1
0
1242
4
4968
4
z
1,3
0
z
3,4
0
z
5,1
0
z
3,1
0
z
4,1
0
1196
7
8372
5
z
2,2
0
z
5,5
0
z
1,2
0
z
4,2
0
z
3,2
0
1168
8
9344
Total manufacturing costs
36304
Permutations without repetitions, combination 33
1
z
4,3
0
z
5,2
0
z
2,3
0
z
2,1
0
1242
5
6210
2
z
1,5
0
z
5,3
0
z
2,5
0
z
4,5
0
z
1,4
0
1235
6
7410
3
z
4,4
0
z
1,1
0
z
3,5
0
z
2,4
0
z
3,3
0
z
5,4
0
1242
4
4968
4
z
1,3
0
z
3,4
0
z
5,1
0
z
3,1
0
z
4,1
0
1196
7
8372
5
z
2,2
0
z
5,5
0
z
1,2
0
z
4,2
0
z
3,2
0
1168
8
9344
Total manufacturing costs
36304The results obtained on the basis of the data implemented for the purpose of the case study let us come to a conclusion that under the very theoretical conditions specified in the article it can be expected that the greater number of manufacturing plants in the system leads to bigger financial savings.


## 4. Conclusions

It can be expected that carrying out more simulation experiments for a certain number of manufacturing plants in the system may deliver even a shorter total manufacturing time which is the time in the system characterised by the longest manufacturing time in its subsystem. This result forms the basis for improving the total manufacturing costs by means of seeking for such a combination of adjusting the sequence of production to plants which minimise the total manufacturing costs. It also seems reasonable to implement other criteria, that is, either the criterion of minimising lost capacity or the criterion of maximising the remaining capacity or the criterion of minimising the replacement time. Nevertheless, the assumptions for the mentioned criteria differ from the ones presented in the case study, emphasising both the criterion of minimising the manufacturing time and the criterion of minimising manufacturing costs. Moreover, it is necessary to analyse the behaviour of the system in case of various initial states obtained at random from data characterised by the same range for drawing.



---

*Source: 5286135-2017-06-28.xml*