Abstract: The aim of optimization of store management is not
only designing the situation of store management itself including its
equipment, technology and operation. In optimization of store
management we need to consider also synchronizing of
technological, transport, store and service operations throughout the
whole process of logistic chain in such a way that a natural flow of
material from provider to consumer will be achieved the shortest
possible way, in the shortest possible time in requested quality and
quantity and with minimum costs. The paper deals with the
application of the queuing theory for optimization of warehouse
processes. The first part refers to common information about the
problematic of warehousing and using mathematical methods for
logistics chains optimization. The second part refers to preparing a
model of a warehouse within queuing theory. The conclusion of the
paper includes two examples of using queuing theory in praxis.
Abstract: The purpose of this work is examining the multiproduct
multi-stage in a battery production line. To improve the
performances of an assembly production line by determine the
efficiency of each workstation. Data collected from every
workstation. The data are throughput rate, number of operator, and
number of parts that arrive and leaves during part processing. Data
for the number of parts that arrives and leaves are collected at least at
the amount of ten samples to make the data is possible to be analyzed
by Chi-Squared Goodness Test and queuing theory. Measures of this
model served as the comparison with the standard data available in
the company. Validation of the task time value resulted by comparing
it with the task time value based on the company database. Some
performance factors for the multi-product multi-stage in a battery
production line in this work are shown.
The efficiency in each workstation was also shown. Total
production time to produce each part can be determined by adding
the total task time in each workstation. To reduce the queuing time
and increase the efficiency based on the analysis any probably
improvement should be done. One probably action is by increasing
the number of operators how manually operate this workstation.
Abstract: How to maintain the service speeds for the business
to make the biggest profit is a problem worthy of study, which is
discussed in this paper with the use of queuing theory. An M/M/1/N
queuing model with variable input rates, variable service rates and
impatient customers is established, and the following conclusions
are drawn: the stationary distribution of the model, the relationship
between the stationary distribution and the probability that there are n
customers left in the system when a customer leaves (not including
the customer who leaves himself), the busy period of the system,
the average operating cycle, the loss probability for the customers
not entering the system while they arriving at the system, the mean
of the customers who leaves the system being for impatient, the
loss probability for the customers not joining the queue due to the
limited capacity of the system and many other indicators. This paper
also indicates that the following conclusion is not correct: the more
customers the business serve, the more profit they will get. At last,
this paper points out the appropriate service speeds the business
should keep to make the biggest profit.
Abstract: In Grid computing, a data transfer protocol called
GridFTP has been widely used for efficiently transferring a large volume
of data. Currently, two versions of GridFTP protocols, GridFTP
version 1 (GridFTP v1) and GridFTP version 2 (GridFTP v2), have
been proposed in the GGF. GridFTP v2 supports several advanced
features such as data streaming, dynamic resource allocation, and
checksum transfer, by defining a transfer mode called X-block mode.
However, in the literature, effectiveness of GridFTP v2 has not been
fully investigated. In this paper, we therefore quantitatively evaluate
performance of GridFTP v1 and GridFTP v2 using mathematical
analysis and simulation experiments. We reveal the performance
limitation of GridFTP v1, and quantitatively show effectiveness of
GridFTP v2. Through several numerical examples, we show that by
utilizing the data streaming feature, the average file transfer time of
GridFTP v2 is significantly smaller than that of GridFTP v1.
Abstract: Probabilistic measures of uncertainty have been
obtained as functions of time and birth and death rates in a queuing
process. The variation of different entropy measures has been studied
in steady and non-steady processes of queuing theory.