Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

One algorithmic approach of ``first-come-first-served queuing systems

From MaRDI portal
Publication:3145285
Jump to:navigation, search

zbMATH Open1265.60172MaRDI QIDQ3145285FDOQ3145285


Authors: Ion Florea Edit this on Wikidata


Publication date: 19 December 2012





Recommendations

  • Simulation algorithm for a variable number of parallel stations queuing system of head-of-line type
  • scientific article; zbMATH DE number 5018644
  • A dynamic-server queuing simulation.
  • An algorithmic approach of retrial queuing system with one serving station. I: The description of the simulation algorithm
  • scientific article; zbMATH DE number 3922342


zbMATH Keywords

algorithmqueueing systemcomputer simulationfirst-come-first-served discipline


Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)



Cited In (4)

  • Simulation algorithm for a variable number of parallel stations queuing system of head-of-line type
  • A dynamic-server queuing simulation.
  • Title not available (Why is that?)
  • An algorithm for Ph/Ph/c queues





This page was built for publication: One algorithmic approach of ``first-come-first-served queuing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145285)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3145285&oldid=16434091"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 07:19. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki