Modeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time

Document Type : Research Paper


Department of Electrical and Electronics Engineering Technology, Yanbu Industrial College, Kingdom of Saudi Arabia.


This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production screening task. Since the operation is being shared, there is a time limit to utilize it in a day. Screening of lots that cannot be completed within the given time has to be continued in the following days. The contributions of this paper is the development of a lot clustering method and factoring the limited time sharing condition and thus develop an analytical model. Comparison results were made using available real historical data. The proposed model provided operation managers with the total cycle time computation method and determining the appropriate cluster size to be loaded into the operation.


Main Subjects

[1] Gross D., Harris C.M. (1998), Networks, Series and Cyclic Queue. Fundamentals of Queueing Theory;
John Wiley, Sons, New York, 189-192.
[2] Halachimi I, Adan I.J.B.F., Wal J.V.D., Heesterbeek J.A.P., Beek P.V.(2000), The design of robotic
diary barns using closed queueing networks; European Journal of Operational Research 124; 437-446.
[3] Kumar S. (2007), Performance analysis of a probabilistic re-entrant line in an environmental stress
testing operation; Doctoral Thesis; Multimedia University.
[4] Kumar S., Omar M.K. (2005a), Stochastic re-entrant line modeling for an environmental stress testing
in a semiconductor assembly industry; Applied Mathematics and Computation 173(1); 603-615.
[5] Kumar S., Omar M.K. (2005b), Performance measure in a probabilistic reflow screening line using
mean value analysis; The AIUB Journal of Science and Engineering 4(1); 53-58.
[6] Little J.D.C. (1961), A proof for the queueing formula: L=λW; Operations Research 9; 383-387.
[7] Muduli P.K., Yegulalp T.M. (1996), Modeling truck-shovel systems as multiple-chain closed queueing
networks; International Transactions in Operations Research 3(1); 89-98.
[8] Narahari Y., Khan L.M. (1995), Performance analysis of scheduling policies re-entrant manufacturing
systems; Computers & Operations Research 23; 37-51.
[9] Narahari Y., Khan L.M. (1996), Modeling re-entrant manufacturing systems with inspections; Journal
of Manufacturing Systems 15; 367-378.
[10] Narahari Y., Khan L.M. (1998), Asymptotic loss priority scheduling policies in closed re-entrant lines:
A computational study; European Journal of Operational Research 110; 585-596.
[11] Park Y., Kim S., Jun C.H. (2002), Mean value analysis of re-entrant line with batch machines and
multiclass jobs; Computers & Operations Research 29; 1009-1024.
[12] Park Y., Kim S., Jun C.H. (2006), Performance evaluation of re-entrant manufacturing system with
production loss using mean value analysis; Computers & Operations Research 33; 1308-1325.
[13] Reiser M., Lavenberg S.S (1980), Mean-value analysis of closed multichain queueing networks;
Journal of the Association for Computing Machinery 27(2); 313-322.
  • Receive Date: 12 February 2007
  • Revise Date: 17 April 2007
  • Accept Date: 29 August 2007
  • First Publish Date: 01 April 2008