Balanced Group Maker
Server Details
Balanced class groups and teams with a real MILP solver: mixed fields, together/apart rules.
- Status
- Healthy
- Uptime
- 100.0% over the last 24 hours
- Last Tested
- Transport
- Streamable HTTP · MCP 2025-11-25
- URL
- ChatGPT
- –
- Claude
- –
TDQS
Scored across 4 tools
Each tool has a clearly distinct role: feasibility check, sample input, the solver itself, and polling for async results. The descriptions explicitly cross-reference each other (check_request points to alternatives, make_groups directs to get_group_result and get_group_example), so misselection is unlikely.
All four names are snake_case with a verb_noun structure (check_request, get_group_example, get_group_result, make_groups). The verbs vary appropriately with purpose (check vs get vs make) and stay predictable.
Four tools is well-scoped for a single-purpose group-balancing service: one feasibility probe, one example, one solver, one async result fetch. No tool feels redundant or missing at the count level.
The lifecycle is covered: pre-check, example input, solve, and retrieve long-running results. Minor gaps remain, such as no cancel-job or job-listing tool and no way to re-fetch a finished result after the 15-minute expiry window beyond the stated behavior.
Available Tools
4 toolscheck_requestCheck whether a request fitsARead-onlyIdempotentInspect
Describe what the user wants in plain words and get back whether this server can do it, which limits it would hit, and the closest thing it CAN do. Instant, no solve. Use it when unsure the tool fits (seating charts, tournament brackets, round-robin schedules, random draws, repeated rotations, very large lists).
Inputs: description (required).
get_group_exampleGet an example group-maker inputARead-onlyInspect
Return the full input JSON of one example, in exactly the shape make_groups accepts: 'classroom' = 30 students, 6 groups, together and apart codes, categorical and numeric fields, blanks; 'teams' = 20 colleagues in 4 teams balanced on a numeric skill and a role. Edit it (people, fields, priorities, number of groups) to match the user's situation.
Inputs: kind (required).
get_group_resultGet a group-maker resultARead-onlyInspect
Fetch the result of a make_groups job that returned status 'running'. Waits up to wait_seconds; call again while status is 'running'. Jobs expire 15 minutes after they finish.
Inputs: job_id (required), wait_seconds.
make_groupsMake balanced groupsARead-onlyIdempotentInspect
Split people into balanced groups with a MILP solver and return each group's members, a per-group summary of every field, the overall mix, a balance score per field (100 = perfectly balanced), notes and warnings. Give groups (a number of groups; sizes then differ by at most 1) OR min_size and/or max_size (the server tries every group count that fits and picks the best); with both, groups decides and the sizes only validate it. priorities maps a field to 1 (most important), 2, 3...; a field left out counts least; equal numbers tie. Solves take up to about 20 s. If the result has status 'running', call get_group_result with its job_id. If it has status 'busy', wait the retry_after_seconds it gives and call again -- one call at a time, never in parallel. If it has status 'error' or 'infeasible', the message says in plain words what to change. Defaults applied (e.g. a field with no priority) are listed in assumptions; tell the user about them. Call get_group_example for a complete, realistic input.
Inputs: goal, groups, people, max_size, +3 more.
Tool Schema Changelog
Recent tool additions, removals, and schema changes observed during successful MCP inspections.
Loading tool schema changelog…
Related MCP Connectors
Builds optimal 24/7 staff rosters with a real MILP solver: rest rules, skills, nights, fairness.
Optimize crew and workforce schedules, resource allocation, and routing with linear and mixed-inte…
Solve production, blending, transport and scheduling problems with LP and MIP.
Generate optimized work shift schedules from staffing demand, availability and fairness rules.
Related MCP Servers
- AlicenseAqualityDmaintenanceEnables solving complex combinatorial optimization problems with logical and numerical constraints through multiple solvers (Z3, CVXPY, HiGHS, OR-Tools). Specializes in portfolio optimization, scheduling, resource allocation, and constraint satisfaction problems.55Apache 2.0
- FlicenseNot gradedqualityDmaintenanceNegotiation math engine for AI agents. Computes Pareto frontiers, generates iso-utility counteroffers, and infers counterpart priorities. 9 tools for any multi-issue negotiation. Zero LLM tokens — pure MILP optimization.-
- AlicenseNot gradedqualityBmaintenanceEnables MCP-capable agents to solve scheduling and integer optimization problems using Google OR-Tools, return proven-optimal or valid solutions, independently verify proposed solutions, and explain infeasible rule sets.MIT
- AlicenseNot gradedqualityDmaintenanceEnables solving Constraint Satisfaction Problems (CSP) like N-Queens, graph coloring, and Sudoku, as well as Linear Programming optimization problems through both MCP tools and HTTP API endpoints.2MIT
Glama MCP Gateway
Add one secure layer between your agents and this server.