Jump to content

Talk:Queueing model

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rgclegg (talk | contribs) at 09:42, 3 October 2006 (Queuing theory vs queuing model). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Looks like this should be merged into queuing theory. Charles Matthews 14:26, 11 December 2005 (UTC)[reply]

It looks like it has been added. (Queueing theory#History and notation) John Reed Riley 02:52, 17 March 2006 (UTC)[reply]
The existing content only talks about the general notation. However, explanation of the classic types of queuing models, such as M/M/1 and M/M/n and how they are analysed is probably needed. This, together with a generalised explanation of how models are formed to reflect reality would distinguish it from queueing theory. -- Cameron Dewe 23:56, 29 July 2006 (UTC)[reply]
I have now expanded the existing content to a better article. I think that this article could be expanded into a substantial article on its own, so merger into queuing theory may not be appropriate any longer. If anything, the explanation of Kendal notation fits better in this article, now, with only a short mention needed in the queuing theory article. -- Cameron Dewe 23:18, 30 September 2006 (UTC)[reply]

Queuing theory vs queuing model

I like the additions to this article and it could become a good article if this keeps up. However, it is mirroring some of queuing theory. How can we best differentiate the two articles. --Richard Clegg 09:42, 3 October 2006 (UTC)[reply]