Page 12 - Azerbaijan State University of Economics

THE JOURNAL OF ECONOMIC SCIENCES: THEORY AND PRACTICE, V.75, # 1, 2018, pp. 4-15

the integrated planning period: quarter and month. In depending on the duration of
the production cycle of two productions:

a) Formed by a linear programming problem must determine xit –number of
products i-th type, released into t-th month, under constraints: on the number
of products by months ≥ , = 1,12 = , , bandwidth equipment
/T
/T
∑ . < , = 1,2 = , , where Nit – minimum monthly volume
/.
/T
.T
/
of production output i-th type; Tij – complexity of manufacturing i-th type of
products into j-th type of the equipment’s; Pjt – fund of working time j-th
type of equipment into t-th month. As a creation can be act: uniform
lo9ading equipment = ∑ J | − ∑ J | → , where Tt – the
2
T
/ /T
/62
/62
average complexity of manufacturing all products included to production
program. t-th month, Ti –full complexity of manufacturing i-th type,
deviation in value monthly production program from planned; at least the
total number of files, produced in a month. Mathematical apparatus of the
synthesis of such models is a mathematical programming.

b) Cycle of manufacturing products for more planning time, as a result of the
solutions of sharing scheduling generalization of the areas assigned to certain
discrete interval time. In this statement uses the following methods: network,
calculation of timing the start of production in relation to output. Scheduling
model used scheduling theory. An example of which model, is the model
used for the Jonson problem: machined parts m, technical and technological
route all the same parts (fig. 3)

1 2 n

…
i – R
ti2
tin
ti1
parts ….

Figure (3) – route of parts

Restriction:

For each part processing on the j-m machine begins on earlier than it is over to (j-
1)-m: ≥ /,.12 , where t the beginning of operations, – the end of operation; on
each machine can process on piece; the beginner operation interrupted to completion

= + to describe the problem using brute force, although this inefficiently
/.
/.
/.
in the high dimensionality of the problem. Frequently used common task scheduling:
12