1999
DOI: 10.1080/002075499191689
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of a flow line systemwith Bernoulli sampling inspections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2000
2000
2017
2017

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…Each one of these classes has its own routing matrix. Therefore, the outcome of each inspection or re-inspection and the routing of items in the system depend on each item's history of previous processings, as pointed out in Lee et al (1999). In a flow line with K machines there are a total of 2 K + 1 distinct classes and corresponding…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations
“…Each one of these classes has its own routing matrix. Therefore, the outcome of each inspection or re-inspection and the routing of items in the system depend on each item's history of previous processings, as pointed out in Lee et al (1999). In a flow line with K machines there are a total of 2 K + 1 distinct classes and corresponding…”
Section: Introductionmentioning
confidence: 99%
“…More in Wittrock (1992) where the rework possibilities are truncated by ignoring "sufficiently improbable" ones. Lee et al (1999) present queueing models for a three-stage system with random inspection at each stage, which take into account all rework combinations of the three operations. For each processing stage, their models calculate the mean flow rates induced by first-pass and rework flows into that stage.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations