2008
DOI: 10.1016/j.ejor.2006.11.016
|View full text |Cite
|
Sign up to set email alerts
|

Predicting performance measures for Markovian type of manufacturing systems with product failures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
15
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 23 publications
0
15
0
Order By: Relevance
“…Li et al (2007) proposed a graphical approach to evaluate the performance of a single station in semiconductor manufacturing. Pradhan et al (2008) proposed analytical models to estimate performance measures for the problem under study when the job arrivals and service times were exponentially distributed. This paper relaxes the Markovian assumptions made in Pradhan et al (2008).…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Li et al (2007) proposed a graphical approach to evaluate the performance of a single station in semiconductor manufacturing. Pradhan et al (2008) proposed analytical models to estimate performance measures for the problem under study when the job arrivals and service times were exponentially distributed. This paper relaxes the Markovian assumptions made in Pradhan et al (2008).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Pradhan et al (2008) proposed analytical models to estimate performance measures for the problem under study when the job arrivals and service times were exponentially distributed. This paper relaxes the Markovian assumptions made in Pradhan et al (2008). If one wishes to analyze a large network with several servers and queues, calculation of the normalization constant that is required in the computation of system probability p(n), where n is the number of jobs in the system could be very complex or almost impossible (Gelenbe and Pujolle, 1987).…”
Section: Literature Reviewmentioning
confidence: 99%
“…That is to say the queueing network model also relies on the aggregate service time of each station. The aggregate service time τj at station Sj has been calculated by the previous studies (see (Damodarana and Hulett, 2012) and (Pradhan et al, 2008)). Eq.…”
mentioning
confidence: 99%
“…Additionally, majority of the analysis of fork-join studies assume that the inputs to the individual buffers are Poisson process [77,105,103,104]. Although [68,86] consider random job failures, they do not consider a fork-join subsystem.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…Jobs that fail are routed to the same workstation or to one of the previous workstations. These characteristics of manufacturing systems make them suitable for modeling as a network of queues consisting of a set of nodes (workstations), and arcs (movement of the job between workstations) [86].…”
Section: Overview Of Solution Approachmentioning
confidence: 99%