# Suupmi

> Suupmi is in early access. The public website offers a model-finder conversation, waitlist and contact forms. Recommendations require team review. Public model creation and execution are not available in this release.

## Key pages
- [Model catalog](http://suupmi.com/models)
- [How it works](http://suupmi.com/#how-it-works)
- [Request a model](http://suupmi.com/request-model)
- [Pricing](http://suupmi.com/pricing)
- [Use cases](http://suupmi.com/use-cases)
- [Join the waitlist](http://suupmi.com/waitlist)

## Pricing
Public access is not yet open. Join the waitlist, or request a custom solution for a reply in less than 48 hours. Suupmi plans to offer monthly Developer, Product and Enterprise plans. Each plan includes a shared usage-credit allowance that can be used with any model in the catalog. Unused credits roll over to the next month. Usage above the allowance is billed as extra.

## Managed API integration
Use the service base URL and organization API key issued for your environment. Confirm installed versions through that service; catalog entries do not establish public deployment.
Authentication: X-API-Key, supplied by your backend or agent runtime.
Crona accepts custom JSON models built from scheduling, packing, assignment, routing and allocation primitives, including supported compositions. No industry profile is required. Custom models use the same managed jobs API as packages. Unsupported mathematical rules require an engine extension; metadata does not enforce constraints.

- GET /v1/solver/capabilities: Installed families, rules and numeric limits
- GET /v1/solver/packages: Installed package IDs, versions and supported scope
- GET /v1/solver/reference: Shared field reference, modeling guides and custom examples
- GET /v1/solver/docs/CLIENT_API.md: Runnable Python solve/rescore example and recovery guide
- GET /v1/solver/packages/{id}/{version}/{document}: Manifest, input/output schemas, example.json and README.md
- POST /v1/solver/jobs: Submit a package or custom request with a time budget
- GET /v1/solver/jobs/{id}: Retrieve execution status, decisions and diagnostics

1. Discover the installed package or shared custom-model schema and read its supported rules before mapping customer data.
2. Preserve source IDs and integer units. Map every business constraint to an enforced field; record requirements the contract cannot express.
3. Submit {request: <versioned model>, timeBudgetMs: 1000} with an Idempotency-Key. Keep that key, request and job ID for retries.
4. Poll the job and inspect the planning status separately: completed execution can contain a PARTIAL plan or CONSTRAINT_VIOLATIONS. Only FEASIBLE means complete required coverage with no hard violations.
5. Verify decisions against the original business data. After manual edits submit the complete result with operation: score; scores are recomputed, not trusted.

## Scheduling
Assign people, machines and jobs to time slots while respecting availability, skills, rules and deadlines.

- [Employee Shift Scheduling](http://suupmi.com/models/scheduling/employee-shift-scheduling): Builds staff rosters that cover demand while respecting contracts, skills and preferences.
  - Crona package: employee-shift-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: Expand coverage into one shift entity per required worker. Each employee has unary capacity, skills, availability, minimum rest and workLimits. Fairness is squared assignment count. Encode each shift start in startTimes. Contract policies must be expressed by these explicit rules; no jurisdiction-specific legal rules are inferred.
- [Job-Shop Scheduling](http://suupmi.com/models/scheduling/job-shop-scheduling): Sequences jobs across machines so orders finish on time with minimal idle time.
  - Crona package: job-shop-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: Sequence ordered job operations on eligible machines with calendars, machine-dependent duration, setup rules and due dates. Complete unary schedules can use critical-block search and adaptive repair while retaining the best feasible plan.
- [Machine Scheduling](http://suupmi.com/models/scheduling/machine-scheduling): Orders work on parallel machines considering setups, speeds and maintenance windows.
  - Crona package: machine-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: Assign and sequence jobs on parallel unary machines with machine-dependent durations, setup rules and maintenance calendars. Complete unary schedules can use critical-block search and adaptive repair while retaining the best feasible plan.
- [Appointment Scheduling](http://suupmi.com/models/scheduling/appointment-scheduling): Books appointments into calendars to maximize capacity and minimize waiting.
  - Crona package: appointment-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: Use resourceOptions bundles to reserve a practitioner, room and equipment simultaneously. earliestStart is the requested time; waiting penalizes start minus requested time. Encode explicit no-show scenarios upstream; this deterministic package does not estimate attendance probabilities or overbook.
- [Maintenance Scheduling](http://suupmi.com/models/scheduling/maintenance-scheduling): Plans preventive maintenance to reduce downtime and spread technician workload.
  - Crona package: maintenance-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: Provide one dated job per recurring occurrence. Bundles reserve the asset and qualified technicians together. Asset calendars are permitted downtime windows. Required priority weights missing work; dueBy measures overdue maintenance. Risk prediction and recurrence expansion belong upstream.
- [Project Scheduling](http://suupmi.com/models/scheduling/project-scheduling): Schedules project activities under precedence and shared resource limits.
  - Crona package: project-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: Precedence and cumulative-resource scheduling with heterogeneous bundles, calendars and optional time-based resource leveling. Set objectives.leveling to minimize the time integral of squared resource usage; balance retains assignment-count fairness.

## Energy
Decide when to charge, discharge, buy, produce or shift energy across prices, forecasts and physical limits.

- [Battery Energy Storage Optimization](http://suupmi.com/models/energy/battery-energy-storage-optimization): Decides when a battery should charge and discharge to cut costs or earn revenue.
- [Economic Dispatch](http://suupmi.com/models/energy/economic-dispatch): Allocates output across generators to meet demand at the lowest cost.
- [Microgrid Optimization](http://suupmi.com/models/energy/microgrid-optimization): Coordinates solar, storage, generators and loads within a local grid.
- [EV Charging Scheduling](http://suupmi.com/models/energy/ev-charging-scheduling): Plans electric vehicle charging within grid limits and departure times.
- [Energy Procurement Optimization](http://suupmi.com/models/energy/energy-procurement-optimization): Chooses the best mix of contracts and spot purchases for expected demand.
- [Demand Response Optimization](http://suupmi.com/models/energy/demand-response-optimization): Shifts flexible loads to respond to grid signals and price peaks.

## Routing & Logistics
Plan routes, fleets and deliveries that respect time windows, capacities and driver rules.

- [Vehicle Routing](http://suupmi.com/models/routing-logistics/vehicle-routing): Plans the best sequence of stops for each vehicle in a fleet.
  - Crona package: vehicle-routing@1.1.0; release-candidate; check deployed API discovery. Scope: Closed, open or specified-endpoint routes and atomic pickup-delivery requests with multidimensional onboard capacity, eligibility and service windows.
- [Fleet Assignment](http://suupmi.com/models/routing-logistics/fleet-assignment): Matches vehicle types to trips or routes based on cost and capacity.
  - Crona package: fleet-assignment@1.0.0; release-candidate; check deployed API discovery. Scope: Trips have fixed startTimes, durations, type eligibility via resourceOptions and per-vehicle requirements. Unary units reserve a vehicle for the entire trip. Capacity dimensions apply concurrently. Operating cost is resourceCosts per trip, not automatically per kilometre.
- [Delivery Scheduling](http://suupmi.com/models/routing-logistics/delivery-scheduling): Assigns delivery slots and dates to orders to balance daily capacity.
  - Crona package: delivery-scheduling@1.0.0; release-candidate; check deployed API discovery. Scope: A slot ID represents a date/window. Capacity is aggregate across assigned orders in the slot. resourceOptions restrict acceptable slots; resourceCosts encode customer preference and delivery cost. Slot dates are metadata; this model assigns slots without computing routes.
- [Shipment Consolidation](http://suupmi.com/models/routing-logistics/shipment-consolidation): Groups orders into fewer, fuller shipments to reduce freight cost.
  - Crona package: shipment-consolidation@1.0.0; release-candidate; check deployed API discovery. Scope: Candidate outbound shipments are resources with multidimensional capacity and fixed freight cost. Orders carry requirements, service/route eligibility and per-shipment costs. Service compatibility must be explicit resourceOptions/requiredSkills; no implicit pairwise compatibility.
- [Warehouse Operations](http://suupmi.com/models/routing-logistics/warehouse-operations): Optimizes picking, slotting and wave planning inside the warehouse.
  - Crona package: warehouse-operations@1.1.0; release-candidate; check deployed API discovery. Scope: Slotting, waves or picking workflows; picking supports explicit endpoints and atomic pickup-delivery requests with onboard capacity.

## Production & Manufacturing
Plan what to produce, how much and when, given capacity, materials, setups and demand.

- [Production Planning](http://suupmi.com/models/production-manufacturing/production-planning): Builds multi-period production plans that meet demand within capacity.
- [Lot Sizing](http://suupmi.com/models/production-manufacturing/lot-sizing): Determines batch sizes that balance setup costs against inventory.
- [Production Mix Optimization](http://suupmi.com/models/production-manufacturing/production-mix-optimization): Chooses which products to make to maximize margin under constraints.
- [Cutting Stock](http://suupmi.com/models/production-manufacturing/cutting-stock): Cuts rolls, bars or sheets into required pieces with minimal waste.
- [Assembly Line Balancing](http://suupmi.com/models/production-manufacturing/assembly-line-balancing): Distributes tasks across workstations to hit target cycle times.

## Assignment & Resource Allocation
Match people, budgets, sites and capacity to tasks and demand under business rules.

- [Workforce Assignment](http://suupmi.com/models/assignment-resource-allocation/workforce-assignment): Assigns people to tasks or projects based on skills, cost and availability.
  - Crona package: workforce-assignment@1.0.0; release-candidate; check deployed API discovery. Scope: Tasks have time windows and durations; worker availability, skills and capacities are hard constraints. Costs and squared assignment-count fairness are soft. Use fixed task startTimes when only staffing is needed.
- [Resource Allocation](http://suupmi.com/models/assignment-resource-allocation/resource-allocation): Distributes limited budget or capacity across competing demands.
  - Crona package: resource-allocation@1.0.0; release-candidate; check deployed API discovery. Scope: Integer demand quantities are bounded by demand and assigned to one eligible resource bundle. requirements and consumption are per unit; budgets apply to total consumption. required=false permits partial/zero fulfillment. No continuous or split-across-bundles allocation. Optional demand:1 items on one scalar units pool can use a memory-bounded knapsack path that optimizes value minus cost; richer contracts retain generic search.
- [Facility Location](http://suupmi.com/models/assignment-resource-allocation/facility-location): Chooses where to open sites to serve customers at the lowest total cost.
  - Crona package: facility-location@1.0.0; release-candidate; check deployed API discovery. Scope: Opening a used site incurs fixedCost once; each assigned customer incurs resourceCosts plus resource.cost. Site capacity is aggregate. Encode service radius by eligible site options computed from caller distances. No geospatial distance calculation is implicit. Resource-dependent customer capacity use is supported through requirementsByResource; scalar zero-opening-cost instances can use regret construction and ejection repair.
- [Capacity Allocation](http://suupmi.com/models/assignment-resource-allocation/capacity-allocation): Allocates shared capacity among customers, products or channels.
  - Crona package: capacity-allocation@1.0.0; release-candidate; check deployed API discovery. Scope: Distribute integer units among customer/product/channel demands. value is revenue per unit and quantity/demand is fill rate. Required coverage is lexicographically prior to revenue; optional demands allow revenue tradeoffs. One bundle per demand, no continuous units.
- [Task Assignment](http://suupmi.com/models/assignment-resource-allocation/task-assignment): Matches individual tasks to agents in real time or in batches.
  - Crona package: task-assignment@1.0.0; release-candidate; check deployed API discovery. Scope: Agents have skills and calendars. Tasks use durationByResource for agent-specific completion time; resourceCosts encode an explicit quality penalty/cost. Lower cost represents better quality; no quality prediction is performed.

## Inventory & Supply Chain
Decide order quantities, stock levels, suppliers and network structure across your supply chain.

- [Inventory Replenishment](http://suupmi.com/models/inventory-supply-chain/inventory-replenishment): Recommends when and how much to reorder for each item.
- [Multi-Echelon Inventory Optimization](http://suupmi.com/models/inventory-supply-chain/multi-echelon-inventory-optimization): Sets stock targets across warehouses and stores together.
- [Supplier Selection](http://suupmi.com/models/inventory-supply-chain/supplier-selection): Chooses suppliers and order splits based on price, capacity and risk.
- [Distribution Network Design](http://suupmi.com/models/inventory-supply-chain/distribution-network-design): Designs which facilities and flows form the best distribution network.

## Packing & Loading
Pack items into bins, containers, sheets and vehicles respecting dimensions, weight and stacking rules.

- [Bin Packing](http://suupmi.com/models/packing-loading/bin-packing): Packs items into the fewest boxes or bins possible.
  - Crona package: bin-packing@1.0.0; release-candidate; check deployed API discovery. Scope: Vector bin packing with any declared capacity dimensions and explicit eligibility. This package does not infer physical placement from volume. Use container-loading for orthogonal geometry.
- [Container Loading](http://suupmi.com/models/packing-loading/container-loading): Builds 3D load plans for containers, trucks and pallets.
  - Crona package: container-loading@1.0.0; release-candidate; check deployed API discovery. Scope: Orthogonal 3D loading with rotations, nonoverlap, support, weight limits and optional center-of-mass bounds.
- [Two-Dimensional Cutting](http://suupmi.com/models/packing-loading/two-dimensional-cutting): Nests rectangular parts on sheets to minimize offcuts.
  - Crona package: two-dimensional-cutting@1.0.0; release-candidate; check deployed API discovery. Scope: Orthogonal rectangular placement with explicit rotations, nonoverlap, boundaries, eligibility, weight and horizontal clearance.
- [Cargo Allocation](http://suupmi.com/models/packing-loading/cargo-allocation): Allocates shipments to available vehicles, flights or vessels.
  - Crona package: cargo-allocation@1.0.0; release-candidate; check deployed API discovery. Scope: Select integer shipment units under weight/volume/budget capacities. Eligibility specifies compatible vehicles; value is per-unit revenue. For indivisible cargo set demand=1. No geometric loading or routing is implied.