| Summary: | 碩士 === 中原大學 === 工業工程研究所 === 93 === Usually, considering a fork-join queueing network can represent a general supply
chain. The fork-join queue has become more importance in near years as it has developed
more completely to describe practical and present system such as parallelism
in computer and storage.
In the general supply chain system, the system will start to produce a new
item while there is a demand from outside require. Therefore, the total items in the
system will assume as a fixed amount. This means that there are always the same
total number of the items in process and end-products in the system. For this kind
of system, it calls inventory-queueing system. The inventory-queue has a production
or process system and system’s output will store in an inventory buffer to satisfy
the random arriving demands. Therefore, it could be defined inventory-queue system
which has fork-join queueing process as a close environment and amount of items in
the cycle will always be fixed and equal to base-stock level.
In this thesis, there are two forms of the fork-join queueing system will be
discussed such as optimal base-stock levels in term of the minimum total costs to
keep the fresh degree of the end-production in the closed network and the relationship
between the base-stock and the response time (delay time) of the outside demands in
the open network.
keywords: Queueing system, Fork-join queueing network (FJQN), inventory-queueing
system, base stock, response time of demands.
|
|---|
