Printer Friendly

Conceptual modeling of the serial logistic system.

Abstract: The paper highlights the problem of mathematical modelling of a logistic system in which production stands are arranged in a series. The problem itself consists in determining the sequence of elements of the order vector which are to be realized subsequently. In order to avoid bringing the production process to a standstill each production stand can be multiplied on demand. The proposed heuristic algorithm of the relative order chooses the required element on which certain operations are carried out. The state of orders decreases after each production decision which influences the state of the whole logistic system at every stage. The lost flow capacity criterion is used on condition that it is associated by bounds.

Key words: mathematical modelling, heuristic algorithm, manufacturing criterion, logistic system

1. INTRODUCTION

In today's highly competitive world, there is an increasing pressure for companies to concentrate on continuous improvements. In the manufacturing environment this means that companies will often review their factory layouts or the way in which the factory is controlled and managed. Simulation of this systems can lead to cost minimizing procedures implemented in companies (Chramcov et al., 2011). While managing the system it is important to provide the correct information about the product at the accurate point of time (Bucki & Chramcov, 2011). Knowing that there is an order to be realized, we can easily find out in advance what kind of charge will be necessary and what amount of it will be needed (Schmidt, 1988). In multi stage job problems, simple priority dispatching rules such as shortest processing time (SPT) and earliest due date (EDD) can be used to obtain solutions of minimum total processing time, but may not sometimes give sequences as expected that are close to optimal (Modrak & Pandian, 2010). Case studies prove that production can be optimized by means of transformation production procedures (Modrak, 2009). Moreover, many problems can be solved by means of adequate multi-criteria decision-making using modern heuristics (Michalewicz & Fogel, 2004).

2. PROBLEM FORMULATION

Let us assume that the sample logistic system consists of I active logistic blocks arranged in a series. Each logistic block is meant to carry out a production operation. There are no buffer stores placed between logistic blocks in the discussed case. Each logistic block consists of a certain number of production stands. If a production stand in the logistic block does not have enough production capacity to accept all production flow, another parallel stand carrying out the same production operation is activated in this exact logistic block. If a production stand is not needed any more, it is deactivated in the discussed logistic block.

Let us introduce the vector of charges W = [[w.sub.l]], l = 1, ..., L and the vector of orders Z = [[z.sub.n]], n = 1, ..., N (given in units). The assignment matrix of ordered products to charges takes the form [OMEGA] = [[[omega].sub.n,l]]. Let us introduce the vector of production machines [M.sub.i] = [[m.sub.i,j]], i = 1, ..., I, j = 1, ..., J, which carry out autonomous operations on the specified n-th product. The operations are realized subsequently.

[FIGURE 1 OMITTED]

If the n-th product is realized by the j-th production stand at the k-th stage, k = 1, ..., K, then [e.sup.k.sub.i,j] = 1. Otherwise, [e.sup.k.sub.i,j] = 0. Moreover, we assume that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. The structure of this serial logistic system is present in the Fig. 1.

Let G = [[g.sub.n,i]] be the life vector for a new brand set of tools for manufacturing the n-th product. At the same time [g.sub.n,i] = [psi] if the n-th product is realized in the j-th production stand of the i-th logistic block, [psi] = 1, ..., [PSI], otherwise, [g.sub.n,i] = 0. We can assume that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. If the number [psi] is reached for the given n-th element of the vector Z in the j-th production stand of the i-th logistic block, the tool in this exact stand has to be replaced by a new one.

Let [S.sup.k-1.sub.n] = [s[(n).sup.k-1.sub.i,j]] be the matrix of state for the n-th product. Let [P.sup.k-1.sub.n] = [p[(n).sup.k-1.sub.i,j]] be the matrix of the flow capacity for the n-th product. We can determine the flow capacity of the j-th production stand in the i-th logistic block for the n-th element of the order vector Z in the form (1).

[p[(n).sup.k-1.sub.i,j] = [g.sub.n,j] - [s[(n).sup.k-1.sub.i,j] (1)

The matrix [T.sup.pr] [[tau].sup.pr.sub.n,i]] includes production times for the n-th product in the j-th production stand of the i-th logistic block. The vector [T.sup.repl] = [[tau].sup.repl.sub.1] ... [[tau].sup.repl.sub.i] ... [[tau].sup.repl.sub.I] includes replacement times for the tools in the logistic system. If [[tau].sup.pr.sub.n,i] [less than or equal to] [[tau].sup.pr.sub.n,i+1], then the j-th production stand of the i-th logistic block becomes blocked while manufacturing the n-th product so there is the need to activate the production stand [m.sub.i+1,j+I]. Let V = [[v.sub.n,i]] be the production rate vector where [v.sub.n,i] is the number of units of the n-th product made in the time unit. The total manufacturing time of all elements from vector Z is given by (2), where [y.sup.k.sub.i] = 1 if the replacement procedure of the tool in the i-th stand is carried out. Otherwise, [y.sup.k.sub.i] = 0

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (2)

3. THE MANUFACTURING CRITERION

The lost flow capacity criterion takes the form (3) and is accompanied by the tool replacement bound in the form (4) as well as by the order bound in the form (5) where [p.sup.k.sub.n,i] is the lost flow capacity of the j-th stand of the i-th logistic block at the k-th stage, c is the maximal allowable tool replacement time, [x.sup.k.sub.n] is the number of units of the n-th element realized at the k-th stage, [[tau].sup.repl.sub.i] is the replacement time of the used tool in the j-th stand of the i-th logistic block. The lost flow capacity criterion is reduced to the replacement time of tools and order bounds.

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (3)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (4)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (5)

4. EQUATIONS OF STATE

The state of the logistic system changes according to the form (6).

S[(n).sup.0] [right arrow] S[(n).sup.1] [right arrow] ... [right arrow] S[(n).sup.k-1] [right arrow] ... [right arrow] S[(n).sup.K] (6)

The state of the j-th production stand of the i-th logistic block changes consequently according to the form (7), which is written as s[(n).sup.k.sub.i,j] = s[(n).sup.k-1.sub.i,j] + [x.sup.k.sub.n], otherwise s[(n).sup.k.sub.i,j] = s[(n).sup.k-1.sub.i,j].

s[(n).sup.0.sub.i,j] [right arrow] s[(n).sup.1.sub.i,j] [right arrow] ... [right arrow] s[(n).sup.k.sub.i,j] [right arrow] ... [right arrow] s[(n).sup.K.sub.i,j] (7)

Let [[rho].sub.i] be the tool to be replaced, 1 [less than or equal to] [[rho].sub.i] [less than or equal to] I. The state of the j-th production stand of the i-th logistic block in case of replacement of tools changes according to the specification (8).

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (8)

The order vector is modified after every decision about production according to (9).

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (9)

5. THE HEURISTIC ALGORITHMS

The heuristic algorithm determines the order element characterized by the maximal relative order coefficient [[gamma].sup.k-1.sub.n] in the state S[(n).sup.k-1].

To produce the element a, the condition in the form (10) must be met where [[gamma].sup.k-1.sub.n] = [z.sup.k-1.sub.n]/[z.sup.0.sub.n]. It is assumed that the orders are realized one after another that is to say each order element [z.sub.n] in the state [S.sup.k-1.sub.n] is reduced partly

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (10)

6. CONCLUSIONS

The problem highlighted in this paper discusses the issue of the sample serial production system with no buffer stores. Production stands are arranged in series. Each stand can also be multiplied by extra parallel stands of exactly the same production possibilities. The system delivers ready products corresponding to the elements of the order vector. The main goal is to fulfil the task set by the criterion. The heuristic algorithm proposed in the paper enables the operator to choose the satisfactory production sequence on the basis of which a certain element of the order vector is determined for realization. The use of one specified algorithm does not mean that we will achieve the result satisfying the given criterion. It is advisable to implement other algorithms and decide which one minimizes the order realization time, the loss of residual capacity and the total replacement time or satisfies a hypothetical customer's demand not specified hereby. To achieve a satisfactory result a big number of simulations must be carried out. Assuming that the results of calculations which are made for one chosen heuristic algorithm do not deliver a satisfactory solution, there arises a need to test other algorithms.

7. ACKNOWLEDGEMENTS

This work was supported by the Ministry of Education of the Czech Republic under grant No. MEB 051024 and No. MEB051031.

8. REFERENCES

Bucki, R. & Chramcov, B. (2011). Control of the serial production system. In: Recent Researches in Automatic Control, Proceedings of 13th WSEAS Int. Conference on Automatic Control, Modelling & Simulation. Lanzarote, May 2005, pp. 352-356, ISBN 978-1-61804-004-6, WSEAS Press

Chramcov, B., Beran, P., Danicek, L. & Jasek, R. (2011). A simulation approach to achieving more efficient production systems, International Journal of Mathematics and Computers in Simulation [online], Volume 5, Issue 4, June 2011, [cit. 2011-06-30]. Available from: http://www.naun.org/journals/mcs/, ISSN 1998-0159

Michalewicz, Z. & Fogel, D. B. (2004). How to Solve It: Modern Heuristics, Springer, 2nd ed. Revised and Extended, 554 p. ISBN 978-3-540-22494-5

Modrak, V. & Pandian, R.S. (2010). Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Tehnicki Vjesnik, 17 (3), 2010, pp. 273-278. ISSN 1330-3651

Modrak, V. (2009). Case on manufacturing cell formation using production flow analysis, Proceedings of World Academy of Science, Engineering and Technology, Volume 37, 2009, pp. 519-523. ISSN: 2010376X

Schmidt, R. (1988). Application of simulation for order sequencing in flow-shop production systems. In Proceedings of the 21st annual symposium on Simulation (ANSS '88), Los Alamitos, CA, USA, pp. 71-89, IEEE Computer Society Press
COPYRIGHT 2011 DAAAM International Vienna
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2011 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Author:Bucki, Robert; Chramcov, Bronislav
Publication:Annals of DAAAM & Proceedings
Date:Jan 1, 2011
Words:1837
Previous Article:Functional finishing of fibrous substrates coated with AG-deposited TiO2 nanoparticles.
Next Article:The analysis of entrepreneurial activity of students of professional studies.
Topics:

Terms of use | Privacy policy | Copyright © 2019 Farlex, Inc. | Feedback | For webmasters