품질을 고려한 3-stage flow line의 수율 근사계산

An approximate procedure for throughput of 3-stage flow line considering quality inspection

This paper develops an algorithm for throughput of a 3-stage flow line with job inspection stations, limited buffer capacity, and exponential processing times. Each stage consists of a single workstation, and an infinite number of jobs always waits in front of the first workstation. Blocking may occur when a processed job is waiting at one workstation for another workstation to become available. Numerical example results provide insights into the problems related to quality inspection and measure of performance of flow lines.