Premium
Markovian analysis of production lines with Coxian‐2 service times
Author(s) -
Vidalis M.I.,
Papadopoulos H.T.
Publication year - 1999
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.1999.tb00170.x
Subject(s) - production line , computer science , production (economics) , line (geometry) , throughput , service (business) , mathematical optimization , mathematics , algorithm , telecommunications , mechanical engineering , geometry , economy , engineering , wireless , macroeconomics , economics
This paper is concerned with the analysis of reliable production lines. The service times at each station of the line are assumed to follow the Coxian‐2 distribution. Raw material arrives at the first station of the line which is assumed that is never empty. Buffers of non‐identical capacities are allowed between successive stations. The structure of the transition matrices of these specific type of production lines is examined and a recursive algorithm is developed for generating them, for any number of stations K . This method allows one to obtain the exact solution of a sparse linear system by the use of the Gauss–Seidel method. From the solution of these systems the throughput rate of the production lines is calculated. However, this algorithm is not computationally efficient as it is restricted by the size of the problem. The main contribution of this paper is the study of the transition matrices of production lines with Coxian service times.