BAHIR DAR

INSTITUTE OF TECHNOLOGY (BiT)

FACULTY OF MECHANICAL AND INDUSTRIAL

ENGINEERING

MSc in Industrial Engineering

(Production Engineering and Management Stream)

Assignment on: Applications of Queuing Models for Modeling and Simulation of

Manufacturing Systems Literature Review and Gap Analysis

Submitted by: Alehegn Melesse

ID.No. BDU0702356PR

Aregawi Yemane

ID.No. BDU0702363PR

Submitted to:

Ephrem Gidey (Ph.D)

July, 2015

0
1
 1. Introduction

Queuing theory is first developed by Agner Krarup Erlang (1878- 1929), to Solve telephone
network congestion problems.

Queuing theory is a branch of mathematics that studies and models the act of waiting in lines.
This paper wills a literature based brief look into the formulation of queuing theory along with
examples of the models and applications of their use. The goal of the paper is to provide the
reader with enough background in order to properly model a basic queuing system into in
manufacturing firms. Also, the reader should begin to understand the basic ideas of how to
determine useful information such as average waiting times from a particular queuing system in
manufacturing firms. In general, queue theory both in service and manufacturing firms have the
following ultimate goals:

 Queues (waiting line) are a part of everyday life.

 Providing too much service involves excessive costs. And not providing enough service
capacity causes the waiting line to become excessively long.
 The ultimate goal is to achieve an economic balance between the cost of service and the
cost associated with the waiting for that service.
 Queuing theory is the study of waiting in all these various guises.

2. General facts on Queuing theory

a. Queuing Theory
In general, queuing analysis are used to find out more about:

 the waiting time of customers,

 the queue length,
 the number of service facilities, and
 the busy period.

Information from the analysis (models) would help to take action either to reschedule the arrivals
or to change the type and number of service facilities.

2
 Characteristics of Queuing System

i. Arrivals or inputs to the system

 Population size, behavior, statistical distribution
ii. Queue discipline, or the waiting line itself
 Limited or unlimited in length, discipline of people or items in it
iii. The service facility
 Design, statistical distribution of service times

Elements of Queuing System

Served Customers leaving the SF

Arrival of customers Service facility (SF)

Queue Service

System

Figure 2.1: A Simple Representation of Queuing System

The above figure shows that the queue and the queue system of any service and manufacturing
sector representation.

 Queue
 A line of waiting customers who require service from one or more service
providers.
 Queuing system

3
  waiting room + customers + service provider

b. Characteristics

1. Arrival Characteristics
 Size of the population
 Unlimited (infinite) or limited (finite)
 Pattern of arrivals
 Scheduled or random, often a Poisson distribution
 Behavior of arrivals
 Wait in the queue and do not switch lines
 No balking or reneging

2. Queue discipline

 First-come-first served (FIFO) – Most common

 Last-come-first-served (LCFS)
 Service in random order (SIRO)
 General discipline (GD) i.e., any type of discipline

3. Customer’s behavior

The customers generally behave in the following four ways:

a. Balking: a customer who leaves the queue because the queue is too long and he/she has
no time to wait or has no sufficient waiting space.
b. Reneging: this occurs when a waiting customer leaves the queue due to impatience.
c. Priorities: in certain applications some customers are served before other regardless of
their arrival. These customers have priority than others.
d. Jockeying: customers may jockey from one waiting line to another. This is most
common in super market.

4. Service Characteristics

4
  Queuing system designs
 Single-channel system, multiple-channel system
 Single-phase system, multiphase system
 Service time distribution
 Constant service time
 Random service times, usually a negative exponential distribution

There are four basic queuing system designs applicable in real world that most researchers use in
different research areas both in manufacturing and service areas. It shall be show in figurative of
each queuing system as follows:

i. Single--channel, single channel, single--phase system

Queue
Arrivals Service departure after service
facility

Fig2.2. Single-channel, single- phase system

ii. Single- channel , multiphase system

Fig2.3. Single- channel, multiphase system

iii. Multi-channel, single-phase system

5
Fig2.4. Multi-channel, single-phase system

iv. Multi-channel, multiphase system

Fig2.5. Multi-channel, multiphase system

c. Classification of Queuing Models

The conventional notation for the characteristics of queuing situation can be given in the
following format; it is also called Lee Kendall’s Notation:

Lee Kendall’s Notation→ (a/b/c): (d/e/f)

Where

a = Description of the arrivals distribution, Poisson Distribution (M)

b = Description of the departures (service time) distribution, constant (D), b = Description of the
departures (service time) distribution, constant (D) ,

6
Exponential (M)

c = Number of parallel servers; (C) = 1, 2, 3, 4, …

d = Queue discipline; FIFO, LIFO, SIRO, GD (any type)

e = Maximum number allowed in the system (in queue plus in service); finite (Q numbers),
infinite (∞)

f = Size of calling source; finite (N) or infinite (∞)

7
 3. Application of Queuing Theory Models for Modeling and Simulation of
Manufacturing System

Queuing network modeling of manufacturing systems has been addressed by a large

number of researchers. The purpose of this paper is to provide a literature of different
articles based on the application of queuing model for modeling and simulation of
manufacturing systems. Some articles related to queuing model are listed below based on
literature form and their applications.

1. Kan Wu, Bert Zwart and eon F. McGinnis; (2009); Compatibility of Queuing
Theory, Manufacturing Systems and SEMI Standards;
http://www.researchgate.net/publication/224289543 .

The paper explained Queuing theory is a powerful method to evaluate the performance of a
manufacturing system. However, when applying it to a real system, both practical and theoretical
issues arise. The practical issues are how to determine the parameter values for queuing models
from the data available in real manufacturing systems. The researcher also explores this issue by
comparing the data needed by queuing models to SEMI standards definitions. The theoretical
issues are the selection of a specific queuing model and its proper use. In order to illustrate this,
they designed a specific situation for the applications of an M/M/1/Unreliable Machine queue,
and compare the performances of two other approaches with it. The results show that, depending
on the approach chosen, the differences in approximation error for cycle time can be over 30% at
lower utilization levels. Index Terms queuing theory, SEMI standards, unreliable machine queue,
utilization.

In queuing theory, the derivations of many similar queues are mainly distinguished by
preemptive and non preemptive events, such as priority queues and vacation queues. However,
instead of classifying by preemptive and non-preemptive events, they classified impacts of
stochastic events on service times into two categories: Type I for WIP-related and Type-II for
Time-related events. Type-I events are usually induced by the existence of WIP, and can only
occur when WIP is presented. However, Type II events can occur anytime, whether WIP exists
or not. For example, breakdowns caused by power outages appear to be time-dependent, and
should be classified as Type-II event. Some typical examples are listed below:

8
Type-I product mix, natural fluctuations, and setup

Type-II power outages, unavailability of operators, and preemptive maintenance (PM)

This article also described different kinds of operational process times which are commonly used
to describe various behaviors of machines, such as takt time, effective process time, and service
time. Understanding these terms is crucial to correctly describe the behavior of a process, which
subsequently allows us to apply queuing theory to manufacturing systems correctly.

Gap Analysis

In most production environments, the utilization must be kept high in order to maintain
competitiveness. Still, the absolute value of the gaps is significant, and such errors could form
the basis of significant design mismatches when such a formula is used as input in an
optimization procedure. Therefore, we believe that the researchers worthwhile to pursue more
sophisticated queuing formulae that better deal with the impact of server breakdowns. The
existence of the gap they did not trying to fill the gap. Instead of trying to give a complete
remedy to the issues of applying queuing theory in manufacturing systems, this paper points out
the issues to face when applying queuing theory in real production environments. For the
theoretical issues, in our assumption, it needs more research on queues with breakdowns should
be conducted in order to fully explore the power of queuing theory in manufacturing systems.
And also proposed intend to develop approximations that take the gap we found into account and
at the same time hold for general distributions.

2. Reza Rashid. Seyed Farzad Hoseini • M. R. Gholamian • Mohammad Feizabadi;

(May, 2015); Application of queuing theory in production-inventory optimization;
DOI 10.1007/s40092-015-0115-9.

This article was deal in electronic industries and it took Electroestil Company as a case study
and it presented a mathematical model for an inventory control system in which customers’
demands and suppliers’ service time are considered as stochastic parameters. The proposed
problem is solved through queuing theory for a single item. In this case, transitional probabilities
are calculated in steady state. Afterward, the model is extended to the case of multi-item

9
inventory systems. Then, to deal with the complexity of this problem, a new heuristic algorithm
is developed. Finally, the presented bi-level inventory-queuing model is implemented as a case
study in Electroestil Company. In this research, the proposed algorithm is coded in C ++ soft ware
to apply a queuing theory in production-inventory model. This model could be implemented
properly for workshop systems. In this paper also, a new production-inventory model is
developed to prepare a cohesive model, demand and production time are considered as stochastic
parameters and queuing theory is used to calculate long-run inventory costs. The proposed model
also has been extended for multi-item inventory systems.

Gap Analysis

In this paper lost sales shortage not considered in the researchers model. So, in future, the model
can be extended through considering back-order shortage. This may increase the complexity of
the problem while the model would become more realistic. Another gap of this research did not
covering corruption rates for perishable inventories.

Generally, this journal article is a good one. For the most part, it is well written, well organized
and uses adequate references.

3. H.T. Papadopoulos, C. Heavey; Queuing theory in manufacturing systems

analysis and design: A classification of models for production and transfer
lines

The purpose of this paper is to provide a bibliography of material concerned with

modeling of production and transfer lines using queuing network models. Both production
and transfer lines have a product-flow layout and are used in mass manufacturing.

It denote production lines as flow lines with asynchronous part transfer, while transfer
lines have synchronous part transfer.

A wide range of modeling techniques are available to address manufacturing system

design and operational problems. From the user’ s point of view it is important to
differentiate between generative and evaluative models. Generative models provide the
user with an ‘ optimal solution’ that satisfies the user’ s objective function. Evaluative
models, unlike generative models, do not provide the user with an ‘ optimal solution’.

10
Instead, these models evaluate a given set of decisions by providing the user with
performance measures. Although generative models have the advantage of providing the
user with an ‘optimal solution’, they are, in general, restrictive in terms of their structural
assumptions, which are usually only transparent to the model developer. Evaluative
models do not guarantee the user an ‘ optimal solution’ , but they usually provide the
user with valuable insights into the problems being addressed. Evaluative and generative
models can be combined by closing the loop between them; that is, one can use
feedback from an evaluative model to modify the decisions taken by the generative
model.

This paper is concerned with queuing network models which are evaluative models. There
are available several schemes to classify discrete manufacturing systems, one classification
scheme is volume of production. Using volume of production as a classification scheme,
three main system types for manufacturing can be identified:

 mass,
 batch, and
 Job shop.

The queuing network models discussed in this paper are used to analyze mass
manufacturing systems. Mass manufacturing is characterized by very high production rates.
Companies that use this type of manufacturing system, therefore, place great emphasis on
efficiency and economy of scale in order to remain competitive. To this end, mass
manufacturing systems have a product-flow layout, as is illustrated in Fig.1.

Key: _ Buffer

_ Station

Fig.3.1. Product-flow layout of mass manufacturing systems

11
According to this paper, Product-flow layout systems can be further classified according to
the method of part transfer, and according to the number of part types produced by the
system. There are three ways of transferring parts between work stations:

 synchronous transfer
 asynchronous transfer and
 Continuous transfer

In systems with synchronous part transfer, parts are transported between work stations
simultaneously. We refer to this type of system as a transfer line. Systems with
asynchronous part transfer, are referred to as production lines or ‘ power-and-free
systems’. In production lines each part moves independently of other parts. Hence this type
of system does not need to be fully balanced. Therefore, manually operated stations
with cycle variations can be easily incorporated into them. As a result, they are
commonly used for assembly operations. In systems with continuous part transfer, parts
move continuously at constant speed. These systems place an upper limit on the time
an operation can take.

Gap Analysis

The article main objective to prepare a bibliography of materials for production and transfer lines
but in our opinion it is better focus on the application of queuing model on production and
transfer line. Why because during our sample survey we have not seen any article work on
production and transfer lines using queuing model.

In our opinion, this journal article is a good one. For the most part, it is well written, well
organized and uses adequate references but it needs a case to show how production line and
transfer lines are applicable in mass, batch and job shop . The article needs to include
recommendations and future directions for further researches.

The paper focused only a literature based on product flow line and transfer lines in mass, batch
and job shop scheduling. It has only definition rather than showing the application of the study
and also did not take a real case study during the studying time.

12
 4. Muhammad Marsudi; The Application of Queuing Theory in Multi-Stage
Production Line

The purpose/aim of this article is:

 to carry out queuing analysis to examine multi-stage production line performance to

facilitate more realistic resource planning
 to help managers in improving the efficiency, effectiveness and selecting the most
suitable policy for assembly systems

The paper adopts an analytical approach based on real life data from an international battery
company producing battery covers for camera model EC-196. The battery production line
consists of six independent workstations namely injection molding, first color spray, second
color spray, ultra-violet (UV) station, assembly station and a packing workstation. The relevant
data for each workstation was collected and the chi-squared goodness test was applied to
determine the arriving and leaving distributions data of processing parts.

To accomplish the objectives of this study, the following steps were used.

1. Select a production line to be studied.

2. Collect data for each workstation. The data are throughput rate, number of operator, and
number of parts that arrives and leaves during part processing. Data for the number of parts that
arrives and leaves are collected at least at amount of ten samples to make the data is possible to
be analyzed by Chi-Squared Goodness Test.

3. Analyze the arriving and leaving data by Chi-Squared Goodness Test to determine its variable
distribution (Exponential or Poisson distribution).

4. Conduct performance measures of each workstation by using equations based on Queuing

theory.

The performance measures need to be measured are: utilization factor (ρ), percentage of
workstation idle time, number of parts in system (Ls), number of parts in queue (Lq), waiting
time spent in queue (Wq), waiting time spent in system (Ws ), and task time.

13
5. Determine the efficiency of each workstation.

6. Make validation of the task time value resulted at step (4) by comparing it with the task time
value based on the company database.

Application

The article applied on Battery production by using an analytical approach based on real life data
from an international battery company producing battery covers for camera model EC-196.

Gap Analysis

The article focused on an analytical approach based on real life data from an international battery
company producing battery using queuing model but in our point of view we proposed to use a
heuristic dispatching rule to identify the best production method then they can use queuing
models. And also they didn’t include how to manage the company to plan their production
effectively and they didn’t give any direction how to examine multi-stage production in a
manufacturing industry by using queuing theory approach.

On this article there is a citation problem it cited in different citation format. The objective and
the output of the study are exactly met. This study examined the production line performance by
using queuing theory at the company producing Canon B. battery lid product. The study has
shown that queuing theory is able to analyze production system such as utilization (ρ),
percentage of idle workstation, number of batch in system (Ls), number of batch in queue (Lq),
expected time spend in queue (Wq), and expected time spent in system (Ws). Generally in our
point of view it is a good article.

5. Maged M. Dessouky; Using Queueing Network Models to Set Lot-sizing Policies for
Printed Circuit Board Assembly Operations

The aim of the article is work on assembly operations to determine the following things.
 To reduce WIP by decreasing the lot size.
 To determine the best lot-sizing policy that minimizes the WIP.
 To set a lot-sizing policy for a printed circuit board assembly process of an
electronics manufacturer.

14
They demonstrate the use of queuing network models to help set manufacturing policy for an
automatic insertion process of a west coast printed circuit board assembly facility. Currently the
lot size for each board type is based on past experience. The purpose of this study was to identify
a new lot-sizing policy that reduces WIP and the manufacturing lead time over using the
historical lot sizes. Small lot sizes can reduce work-in-process inventory (WIP) and
manufacturing lead time if the setup times are not much larger than the unit runs times. A
reduction in the lead time allows the manufacturer to respond quicker to new customer orders or
any changes in demand and increases the likelihood of meeting the demand on-time. Small lot
sizes tend to reduce the WIP because a lot spends less time at a machining center, causing new
arriving lots to wait less for the machines to become available. However, reducing the lot size
too much can sometimes have the opposite effect by increasing WIP because machine utilization
may increase significantly due to an increase in the setup times. Thus, the selection of an
appropriate lot size needs to take into consideration the setup time.

Gap Analysis

In our opinion, this article was better to doing by heuristic approach rather queuing model
because heuristic approach show different priorities to select the best method to assemble the
product like different dispatching rules like, due date, shortest processing time, maximum
processing time, etc and also there is no any scenario why the researcher select lead time and
work –in-process to calculate lot size.

On this article there is no clear methodology, research questions, and problem formulation of the
paper on how to reduce the lot size by minimizing the work in progress (WIP). There is no any
scenario mentioned in the paper why the researcher selects WIP to minimize the lot size of the
manufacturing process. There are also no data collection methods. Only literatures which support
the topic are presented throughout the study.

6. Manish K. Govil and Michael C. Fu; (1999). Queuing Theory in Manufacturing: A Survey
Journal of Manufacturing Systems, Vol. 18/1No. 3.

This paper surveyed the contributions and applications of queuing theory in the field of
discrete part manufacturing. Provided are concise, descriptive summaries, rather than
detailed mathematical models, of the various queuing theory results in the manufacturing
15
context. The survey classified the contributions into two groups: descriptive (performance
analysis) and generative (design, planning, and control). Also reviewed is software based
on analytical models in queuing theory, as applied to manufacturing.

This article has a detail literature on a queuing model application in theoretical form and the
basic definition of the article is summarized as follows in the following paragraph.

A typical manufacturing system consists of a number of resources that process a variety

of products. The parts arriving at the different resources have to wait in queues if the
resources are not available. Thus, there are numerous queues in the system at the various
resources, and there are interactions between these queues. The system is dynamic in the
sense that the arrival patterns of products are dependent on the product demand, which is
stochastic. The processing rates of the resources are stochastic because resources exhibit a
natural variation in their performance. Also, the resources are subject to unforeseen failures.
These characteristics of manufacturing systems make them suitable for modeling as
networks of queues, where machines and parts are modeled as servers and customers,
respectively. The buffers at the machines are the queues where the parts wait for
processing. The stations are the nodes of the network, with the material flowing between
these nodes as specified by their routing. The parts enter the network at a node, are
processed on several stations, and leave the system from some node. If all the servers at
a station are busy, any part arriving at that station joins the queue (the buffer) and waits
until a server is available. Approaches found in literature to model the problems
associated with the different manufacturing systems were presented.

Gap Analysis

This article has not mentioned the authors’ work rather only explained the theoretical aspect of a
queuing theory in a manufacturing system as a general point of view. So it has no any output to
the industry because it is difficult to implement in real practical aspect. So we proposed, it shall
be using different manufacturing systems I queuing theory practically.

16
 7. A. Haskose, B.G. Kingsman, D. Worthington; (2001); Modeling flow and jobbing
shops as a queuing network for workload control, Int. J. Production Economics
78(2002) 271 285

This article described how the job shop environment may be formulated as an open queuing
network. It is computationally impossible to solve the model exactly if there are more than
three or four work stations. Results for an exact Markov process model for a triangular
configuration of work stations are described. Initial results suggest that treating each work
station as an independent queuing system leads to significant under-estimation of the
manufacturing lead times, even for such a simple manufacturing system. Some initial ideas
on deriving an approximation of the exact model to cover larger systems are also discussed.
The queuing model and its application in manufacturing process are surveyed on this article
like:

 Queuing networks, modeling manufacturing systems and workload control

 Queuing networks with finite buffers and blocking
 The exact modeling of an arbitrary triangular network of queues
 The approximation of tandem queuing systems

The paper by comparison between the exact and approximation of the final output of the work on
queuing network with work load control.

Exact and approximate models for queuing networks with blocking have been developed. The
exact models are feasible for small systems and indicate that the traditional M/M/1 and M/M/1/K
formulae can lead to serious errors when used to estimate manufacturing lead times, jobs turned
away and work in process. Results from the approximate model suggest that it can be used to
produce reasonably accurate results for large tandem; and furthermore that the traditional
formulae continue to produce serious errors for these larger systems.

The approximate method, if it can be shown to be of acceptable accuracy for arbitrary queuing
networks, will enable the relationships between the amount of jobs turned away and the work in
process and manufacturing lead times for given job arrival rates and processing capacities to be
determined. This then opens up the possibility of manufacturers being able to model the strategic

17
planning process in terms of the level of service to over customers. The approximate model will
also give the queuing time norms to use for each workstation for day to day planning.

Gap Analysis

This article focused on how the job shop environment may be formulated as an open queuing
network by integrating queuing model and Markov process for exact and approximation method
for the purpose of workload control. In our point of view the researcher not put any scenario why
they select exact and approximate method to do workload control in manufacturing systems. As
we have seen in the paper it is better to by using arena simulation software to solve more than
three work stations and easily know the blocking of the workload on each work station. We think
it is simple and ease to manipulate rather to use integration Markov with others.

8. Boualem Rabta, Arda Alp and Gerald Reiner; Queuing Networks Modeling
Software for Manufacturing

This paper reviews the evolution of queuing networks software and its use in manufacturing. In
particular, the researcher discusses two different groups of software tools.

 First, there are queuing networks software packages which require a good level of
familiarity with the theory.
 In the other hand, there are some packages designed for manufacturing where the model
development process is automated.

Queuing Networks Software explained in this article

The developed theory motivated the development of many software packages for the analysis
of queuing networks. These packages suppose a good level of familiarity with queuing
theory. There are some early packages that were based on original algorithms. Some of them
are listed in the following ways.

The Queuing Network Analyzer (QNA) has been proposed by Whitt as implementation of
his two-node decomposition method. QNET is another software package for performance
analysis of queuing networks. It is the implementation of the analysis algorithm based on

18
Brownian approximation of queuing networks (motivated by heavy traffic theory). This
package is written in text mode and its source code is available for free download.

PEPSY-QNS /Win PEPSY: It has been developed at the University of Erlangen Nurnberg
in early 90s. It has a comfortable and easy to use graphical environment. This package
includes more than 50 different analysis algorithms. The Windows version (Win PEPSY) has
particular features: a user friendly graphical interface, a graphical network editor, charts for
results.

QNAT: The Queuing Network Analysis Tool (QNAT) is a Windows graphical package for
analyzing a wide variety of queuing networks. QNAT uses Mathematical as its computing
platform and can handle general configurations of open and closed networks of both finite
and infinite capacity queues. Incorporation of fork join nodes, multiclass customers, mixed
customer classes and blocking mechanisms of different types are some of the other features
available in this software tool.

RAQS: Rapid Analysis of Queuing Systems (RAQS) is Windows graphical queuing

software based on the Whitt’s QNA method and its version. It also implements
decomposition algorithms for closed queuing networks and for tandem finite buffer queuing
networks. It’s freely available for download. RAQS’ user interface provides less explanation
for inexperienced users. Most probably, input and output interfaces are more suitable for
experienced users who owns considerable amount of knowledge on basics of queuing theory.

QTS: Queuing Theory Software is written as Excel spreadsheet for solving a wide range of
queuing models and other probability models (Markov chains, birth and death processes...).
One advantage of this software is that the user has all-in-one model and several performance
indicators (e.g., server utilization, mean number of jobs in the system and in the queue, mean
waiting time in the system and in the queue...) in a simple sheet.

JMT: The Java Modeling Tools is a free open source suite implementing several algorithms
for the exact, asymptotic and simulative analysis of queuing network models. Models can be
described either through wizard dialogs or with a graphical interface. The workload analysis
tool is based on clustering techniques. The JMT tool is user-friendly including a visual

19
design tool. Also, visual sliding buttons for simulation parameters (e.g. avg. arrival rate, avg.
service time, buffer size and simulation time) makes what-if analysis easy for the user.

Queuing Networks Software for Manufacturing

Additionally the previous software tools, more specific software packages were designed for
manufacturing based on queuing networks theory. Such modeling aid is automatic and
embedded in the software and provides the user a unique ability to model the manufacturing
system without worrying about the theoretical side. They are particularly suitable for use by
industrials with little or no queuing knowledge.

Some of the queuing network software packages are public domain while others are
commercially sold by a software vendor. CAN-Q is a recursive algorithm for solving a
product-form stochastic model of production systems based on the results of Jackson and
Gordon and Newell. Other early packages include Q-LOTS includes an embedded dynamic
model that is based on queuing network theory and provides common performance results
such as WIP, tool utilization, production rate. The tool also provides trade-off analysis
among inventory levels, flow times, reliability of the tools, etc.

MPX is perhaps the most popular software package in its category. It is the successor of
MANUPLAN. Users greatly appreciate the speed of calculations and the ease of modeling
despite of several missing improvements possibilities in its behavior and interface. The exact
MPX’s algorithm is not published. Apparently, it uses the classical decomposition algorithm)
coupled to the operator/workstation algorithm with some changes to support additional
features. It also provides a procedure to compute optimal lot sizes and transfer batch sizes.

Still that the existing software model is quite generic and does not integrate high level of
complexity. For instance, MPX does not provide support for some manufacturing features
like finite capacity of buffers, service disciplines other than first come-first-served and
dynamic lot sizing nor for some popular production systems (e.g., Kanban).

On the other hand several industries prefer to use systems design software such as SAP-APO,
IBM’s A-Team, etc., and those generate their solution based on heuristics, relaxations or
approximations different than queuing software solutions. However, usually those

20
 approaches have limitations. Their performance change based on certain settings and in
general, user needs to complete several experiments to determine the most suitable algorithm.
Additionally computation speed becomes one of the most important practical considerations.
Instead of those all-in one, multi functional software designs, queuing software can provide
quick and easy solutions while covering dynamics and related effects but not higher levels of
system details.

Gap Analysis

On this article explained only different software package applications in queuing theory in
literature based, in our investigation the paper tried to show the packages advantage, application
areas but did not show hot its can be done, what parameters needed, what is the expected output
of work. So in our point of view, it is better to add details like rather to show in highlight some
basic queuing software packages; like

 Installation steps
 Input parameters
 Expected outputs from the software
 Clearly listed its application etc.

Generally, this journal article is a good one. For the most part, it is well written, well organized
and uses adequate references but it needs a case to show how uses the software packages in
queuing theory applications in different manufacturing industries. The paper focused only a
literature based on software packages in queuing theory research areas. It has only definition
rather than showing the application of the study and also did not take a real case study during the
studying time.

9. Muhammad Marsudi, Dzuraidah Abdul Wahab, and Che Hassan Che Haron;
Application of Spreadsheet and Queuing Network Model to Capacity Optimization
in Product Development; World Academy of Science, Engineering and Technology;
Vol:3 2009-10-24

This article focused on modeling of a manufacturing system enables one to identify the effects
of key design parameters on the system performance and as a result to make correct decision.

21
This paper proposes a manufacturing system modeling approach using a spreadsheet model
based on queuing network theory, in which a static capacity planning model and stochastic
queuing model are integrated. The model was used to improve the existing system utilization in
relation to product design. The model incorporates few parameters such as utilization, cycle time,
throughput, and batch size.

The article set as a conclusion the output of the integration Spreadsheet model with
deterministic-static feature and stochastic feature. This spreadsheet model enables the designer to
make various changes in decision parameters (i.e. sij and tij are affected by design parameters)
and examine the effect of the changes on performance measures very easily and quickly. In other
words, the time needed for design phase can be reduced for a new product because redesign
activities have been done in the earlier stage of design phase. In other words, design changes
initiated as a result of analysis using the model are possible to be performed in the earlier stage
of design phase of a product. So the time for launching new product can also be reduced. The
study also showed that the validity of spreadsheet model is good enough to apply and maximum
value of relative error.

Gap Analysis

This article basically focused on Front door-sash for car manufacturing cycle time by using
spreadsheet and arena software simulations to measure performance measures of product
development. In our opinion, it may be good using other single queuing theory model to
simplifying the work complexity.

On this article there is no clear methodology, research questions, and problem formulation of the
paper on how to reduce the lead time door-sash for car manufacturing to determine the
performance for the purpose of in product development. There is no any scenario mentioned in
the paper why the researcher selects lead time develop a product of the manufacturing process in
front car assembly.

22
 10. Li ZHUANG and K.S. HINDI; Mean value analysis for multiclass closed
queuing network models of Flexible Manufacturing Systems with limited
buffers; European Journal of Operational Research 46 (1990) 366-379.

The central idea of the article is explained mean value analysis for multiclass closed queuing
network models of Flexible Manufacturing Systems (FMS) are modeled as multiple class
queuing networks with a central server configuration and finite queue capacities. Under
the assumption of exponential service time distribution, an extended Mean Value Analysis
(MVA) algorithm was developed for the exact evaluation of performance measures. The
accuracy of the proposed algorithm is established by comparison with the results of
simulation experiments. In this paper, FMS are modeled as multiple class closed queuing
networks with a central server configuration and finite queue capacities.

Gap Analysis

This article focused on mean value analysis for multiclass closed queuing network models of
Flexible Manufacturing Systems are modeled as multiple class queuing networks with a
central server configuration and finite queue capacities. But in our opinion, gaps in this paper
the authors did not show any direction, if the system will be open queuing network models and
the capacities will be infinite.

23
Reference

1. Kan Wu, Bert Zwart and eon F. McGinnis; (2009); Compatibility of Queuing Theory,
Manufacturing Systems and SEMI Standards;
http://www.researchgate.net/publication/224289543
2. Reza Rashid. Seyed Farzad Hoseini • M. R. Gholamian • Mohammad Feizabadi; (May,
2015); Application of queuing theory in production-inventory optimization; DOI
10.1007/s40092-015-0115-9.
3. H.T. Papadopoulos, C. Heavey; Queuing theory in manufacturing systems analysis
and design: A classification of models for production and transfer lines
4. Muhammad Marsudi; The Application of Queuing Theory in Multi-Stage Production
Line
5. Maged M. Dessouky; Using Queueing Network Models to Set Lot-sizing Policies for
Printed Circuit Board Assembly Operations
6. Manish K. Govil and Michael C. Fu; (1999). Queuing Theory in Manufacturing: A Survey
Journal of Manufacturing Systems, Vol. 18/1No. 3.
7. A. Haskose, B.G. Kingsman, D. Worthington; (2001); Modeling flow and jobbing shops
as a queuing network for workload control, Int. J. Production Economics 78(2002) 271
285
8. Boualem Rabta, Arda Alp and Gerald Reiner; Queuing Networks Modeling Software for
Manufacturing
9. Muhammad Marsudi, Dzuraidah Abdul Wahab, and Che Hassan Che Haron; Application
of Spreadsheet and Queuing Network Model to Capacity Optimization in Product
Development; World Academy of Science, Engineering and Technology; Vol:3 2009-10-
24
10. Li ZHUANG and K.S. HINDI; Mean value analysis for multiclass closed queuing
network models of Flexible Manufacturing Systems with limited buffers; European
Journal of Operational Research 46 (1990) 366-379.
11. Jin Y. Wang; (2009); Queuing Theory; College of Management, NCTU Operation
Research II
12. RYAN BERRY; QUEUING THEORY

24