Production Scheduling MCP
Click on "Deploy Server".
Wait a few minutes for the server to deploy. Once ready, it will show a "Started" state.
In the chat, type
@followed by the MCP server name and your instructions, e.g., "@Production Scheduling MCPSchedule the sample shop and protect the urgent pump's due date."
That's it! The server will respond to your query, and you can continue using it as needed.
Here is a step-by-step guide with screenshots.
Production Scheduling MCP
A small real production scheduler for AI assistants.
AI assistants can guess production plans; this server gives them a real solver so the plan fits machines, down times and due dates. It is a small, local MCP tool from ArchiPlan.
Why use it
Language models can write plans that look right but break real limits: machines get double-booked, downtime is ignored, and due dates are missed. A model cannot prove the plan works. Constraint solvers do this math well, but usually need code. This server joins them: you talk, the solver plans. OR-Tools CP-SAT is the constraint solver used here, the same kind of solver used in industry.
It is for:
Small plants planning a few machines and orders
Job shops and print shops balancing deadlines
Workshops coordinating shared equipment
Planners who use Claude, ChatGPT, Cursor, or another MCP client
Related MCP server: CHUK MCP Solver
What it does
It assigns ordered job steps to eligible machines, avoids machine conflicts and downtime, and minimizes priority-weighted lateness before finish time. It returns a plan per machine, late-order reasons, utilization, and a Mermaid Gantt chart. It runs locally over stdio.
Example chat
You: Schedule the sample shop and protect the urgent pump's due date.
Assistant: The urgent pump finishes at 2026-01-05 11:30, before its 13:00 due time. Housing A is late by 1 hour. Reason: “Assembly-1 was busy with Urgent pump until 2026-01-05 11:30 before this step.”
gantt
dateFormat YYYY-MM-DD HH:mm
axisFormat %H:%M
section CNC-1
Flange A step 1 :CNC-1_0, 2026-01-05 08:00, 2026-01-05 10:00
Valve A step 1 :CNC-1_1, 2026-01-05 10:00, 2026-01-05 12:00
Housing B step 1 :CNC-1_2, 2026-01-05 12:00, 2026-01-05 14:30
Flange B step 1 :CNC-1_3, 2026-01-05 14:30, 2026-01-05 16:00
section CNC-2
Urgent pump step 1 :CNC-2_0, 2026-01-05 08:00, 2026-01-05 09:30
Valve B step 1 :CNC-2_1, 2026-01-05 09:30, 2026-01-05 11:00
Bracket B step 1 :CNC-2_2, 2026-01-05 14:00, 2026-01-05 16:00
section CNC-3
Housing A step 1 :CNC-3_0, 2026-01-05 08:00, 2026-01-05 11:00
Panel step 1 :CNC-3_1, 2026-01-05 11:00, 2026-01-05 13:00
Bracket A step 1 :CNC-3_2, 2026-01-05 13:00, 2026-01-05 15:30
section Assembly-1
Urgent pump step 2 :Assembly-1_0, 2026-01-05 09:30, 2026-01-05 11:30
Housing A step 2 :Assembly-1_1, 2026-01-05 11:30, 2026-01-05 13:00
Housing B step 2 :Assembly-1_2, 2026-01-05 14:30, 2026-01-05 15:30
section Assembly-2
Valve B step 2 :Assembly-2_0, 2026-01-05 11:00, 2026-01-05 12:00
Valve A step 2 :Assembly-2_1, 2026-01-05 12:00, 2026-01-05 13:00
Panel step 2 :Assembly-2_2, 2026-01-05 13:00, 2026-01-05 14:30get_example returns this five-machine, ten-order shop, with CNC-2 down for three hours. It finishes in 8.0 hours.
Set up in one minute
Only uv is needed. uvx fetches the package and a compatible Python interpreter if needed.
Claude Desktop — add under mcpServers in claude_desktop_config.json:
{"mcpServers": {"production-scheduling": {"command": "uvx", "args": ["production-scheduling-mcp"]}}}Claude Code — run:
claude mcp add --transport stdio production-scheduling -- uvx production-scheduling-mcpCursor — add to .cursor/mcp.json:
{"mcpServers": {"production-scheduling": {"command": "uvx", "args": ["production-scheduling-mcp"]}}}Try asking
“Schedule these orders to meet due dates. Prioritize the urgent pump.”
“Which orders will be late, and what machine caused the delay?”
“What if CNC-2 is down Wednesday morning?” The assistant changes downtime in the input and asks this solver again; there is no separate what-if tool.
Input format
Hours are decimals from plan start; values are rounded to whole minutes. start is an optional ISO datetime for labels (default 2026-01-05T08:00). Steps run in the order supplied and list duration plus eligible machines. Priority defaults to 1; higher values give an order more weight when reducing lateness.
{
"start": "2026-01-05T08:00",
"machines": [{"name": "CNC-1"}, {"name": "CNC-2", "down_times": [[3, 6]]}],
"orders": [{"name": "Urgent pump", "due_hour": 5, "priority": 10, "steps": [{"hours": 1.5, "machines": ["CNC-1", "CNC-2"]}, {"hours": 2, "machines": ["Assembly-1"]}]}]
}Limits
For small and medium shops. Solve time is capped at about ten seconds. It does not model shifts, labor, inventory, setup times, or every production constraint. Check the result against your shop rules before using it.
Bigger shop? Use ArchiPlan
ArchiPlan adds support for larger plans, saved plans, and team use.
This server cannot be deployed
Maintenance
Related MCP Connectors
Field operations on a deterministic solver — run jobs, crews & fleet from Claude or ChatGPT.
Optimize crew and workforce schedules, resource allocation, and routing with linear and mixed-inte…
Manufacturing BI from your AI client: dashboards, OEE, spreadsheets, scheduling, text-to-CAD.
Generate optimized work shift schedules from staffing demand, availability and fairness rules.
Related MCP Servers
- AlicenseNot gradedqualityDmaintenanceMCP-ORTools integrates Google's OR-Tools constraint programming solver with Large Language Models through the MCP, enabling AI models to: Submit and validate constraint models Set model parameters Solve constraint satisfaction and optimization problems Retrieve and analyze solution21MIT
- AlicenseAqualityFmaintenanceProvides constraint satisfaction and optimization capabilities to LLMs and AI agents for scheduling, resource allocation, routing, budget optimization, and configuration problems using Google OR-Tools CP-SAT solver.55Apache 2.0
- AlicenseCqualityDmaintenanceEnables Large Language Models to submit and solve constraint satisfaction and optimization problems using Google OR-Tools through JSON model specification.11MIT
- AlicenseBqualityDmaintenanceEnables AI assistants to solve linear, integer, mixed-integer, and knapsack optimization problems using Google OR-Tools via a simple JSON interface.3MIT