Queueing Networks
Stochastic modeling of waiting lines and resource allocation.
Avg. arrivals from outside the system per unit time (comma-separated list).
Capacity per server at each node (must be > gamma).
Probability of moving from node i to node j. Sum of each row should be less than or equal to 1.
Ready for calculation. Enter parameters and solve to see results.
Run network solver to generate graph
Inventory Optimization
Optimal order quantities and timing to minimize total supply chain costs.
EOQ
(R, Q)
Total units required per period (e.g., units/year).
Flat cost incurred whenever an order is placed.
Cost to carry one unit in stock for one period.
Ready for calculation. Enter parameters and solve to see results.
Calculate inventory policy to generate chart
Route Planning (TSP)
Solving the Traveling Salesperson Problem for optimal Hamiltonian cycles.
Distinct identifiers for locations to be visited.
Travel cost/distance between nodes. Format: Source, Target, Cost.
Ready for calculation. Enter parameters and solve to see results.
Optimize route to generate map