QueueSim

Ingested from the official MCP Registry

FastDrop pulled this entry from the official MCP Registry as com.queuesim/public and probed the endpoint. The maker did not submit it, so the outbound link is not endorsed and the description is not theirs.

If this is your server, claim the listing to edit it and take ownership. The registry index lists everything else still awaiting a probe.

Tools this endpoint exposes

Read directly from the endpoint on 28 Jul 2026. Not supplied by the maker.

• simulate_mmc

  Run a generic M/M/c queue simulation. Provide an arrival rate (λ, arrivals/hour), a service rate per server (μ, customers/hour each server can finish), and a server count (c). Optional: distribution s

• list_scenarios

  List the four pre-built QueueSim scenarios. Returns key, title, and one-line description for each (Single Server, Coffee Shop, Grocery Checkout, Call Center). Call this when the user's problem matches

• describe_scenario

  Return full details for one preset scenario: title, description, teaching note, peak parameters, and per-hour arrival + staffing arrays. Use this before simulate_scenario to understand the default sha

• simulate_scenario

  Run one of the four preset scenarios (single, coffee, grocery, callcenter) with optional overrides. Overrides apply UNIFORMLY across open hours — e.g. setting servers=5 on 'coffee' replaces the 4/6/4

• simulate_schedule

  Run a queueing simulation against an arbitrary 24-hour staffing schedule. Take this when the user describes a custom day shape that doesn't match a preset (e.g., 'my coffee shop is open 6am–10pm with

• compare_separate_vs_pooled

  Run the classic operations-research teaching demo: pooled queueing (one shared queue, c servers) vs separate queues (c independent queues, one server each, λ/c traffic to each). Both runs have identic

• explain_queueing_theory

  Return a ~500-word educational explainer of M/M/c queueing theory: Little's Law, utilization, why averages mislead, how simulation relates to Erlang-C. No inputs. Use this when the user asks a concept

• explain_advanced_patterns

  Return a textbook-level description of six queueing complexity patterns beyond basic M/M/c: abandonment/reneging, priority tiers, overflow routing, skills-based routing, compound service, and server o

Is this tool yours?

Claim this listing and we’ll verify ownership before handing it over.