Abstract
Cyclic queueing network with deterministic service times is modeled as 'linear dynamical system', using max-algebra. Its unique eigenvalue λ is given in the 'close form', λ = f(S1,S2, Sn, N), where S1 is the service time of the i-th server, and N is the number of customs in system. This result is applied to optimize the production lines with finite number of pallets.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
