I have created two real states for each entity and depending on the probability based, assigned to each entity a different processing time. I guess that this should work, but now I realized that I have another problem. Before the two servers that I mentioned in the post, I have another server with a lower processing time. It is supposed that Server 2 and Server 1, that have a larger processing time, should create a bottleneck, and I want that all the queue stays in the input buffer of that Server (let's say Server 0). The problem is that the entities that finishes at Server 0, go directly to the server 1, although I specified that the output buffer of the Server 0 is 0, the path capacity is 1, and the input buffer of Server 1 is 0. I even can appreciate how some entities that arrive to the Server 0, if this server is busy, skips that server and pass directly to the next one.
How it is possible?
I want to create the queue in the Server 0, and then move to the other ones when they are empty, always following a FIFO rule.
Thank you so much.