{"provider":"Suupmi","platform":"Suupmi","name":"Suupmi","description":"Early-access optimization model catalog. Public recommendations require team review; no public model execution is available.","pricingModel":"Usage-based","pricingUrl":"http://suupmi.193.70.74.163.sslip.io/pricing","waitlistUrl":"http://suupmi.193.70.74.163.sslip.io/waitlist","accessStatus":"waitlist","catalogUrl":"http://suupmi.193.70.74.163.sslip.io/models","integration":{"availability":"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.","customModels":"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.","endpoints":[{"method":"GET","path":"/v1/solver/capabilities","purpose":"Installed families, rules and numeric limits"},{"method":"GET","path":"/v1/solver/packages","purpose":"Installed package IDs, versions and supported scope"},{"method":"GET","path":"/v1/solver/reference","purpose":"Shared field reference, modeling guides and custom examples"},{"method":"GET","path":"/v1/solver/docs/CLIENT_API.md","purpose":"Runnable Python solve/rescore example and recovery guide"},{"method":"GET","path":"/v1/solver/packages/{id}/{version}/{document}","purpose":"Manifest, input/output schemas, example.json and README.md"},{"method":"POST","path":"/v1/solver/jobs","purpose":"Submit a package or custom request with a time budget"},{"method":"GET","path":"/v1/solver/jobs/{id}","purpose":"Retrieve execution status, decisions and diagnostics"}],"steps":["Discover the installed package or shared custom-model schema and read its supported rules before mapping customer data.","Preserve source IDs and integer units. Map every business constraint to an enforced field; record requirements the contract cannot express.","Submit {request: <versioned model>, timeBudgetMs: 1000} with an Idempotency-Key. Keep that key, request and job ID for retries.","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.","Verify decisions against the original business data. After manual edits submit the complete result with operation: score; scores are recomputed, not trusted."]},"plans":[{"name":"Developer","description":"For prototypes, internal tools and agent workflows.","billing":"Monthly subscription","features":["Access to every model in the catalog","API access from your code or agent","Monthly usage credits","One credit balance across all models","Unused credits roll over to next month","Additional usage billed separately","Models, solvers and infrastructure managed by Suupmi"]},{"name":"Product","description":"For SaaS, ERP integrations and services your customers use.","billing":"Monthly subscription","features":["Access to every model in the catalog","API access for your products and services","Monthly usage credits","One credit balance across all models","Unused credits roll over to next month","Additional usage billed separately","Models, solvers and infrastructure managed by Suupmi"]},{"name":"Enterprise","description":"For larger workloads, multiple products and custom requirements.","billing":"Tailored monthly plan","features":["Access to every model in the catalog","API access for products, internal tools and agents","Monthly usage allowance scoped to your needs","One credit balance across all models","Unused credits roll over to next month","Additional usage billed separately","Models, solvers and infrastructure managed by Suupmi"]}],"categories":[{"slug":"scheduling","name":"Scheduling","description":"Assign people, machines and jobs to time slots while respecting availability, skills, rules and deadlines.","models":[{"slug":"employee-shift-scheduling","name":"Employee Shift Scheduling","summary":"Builds staff rosters that cover demand while respecting contracts, skills and preferences.","applications":["Retail rosters","Hospital nurse planning","Call-center staffing"],"objectives":["Labor cost","Coverage","Fairness","Overtime"],"nativePackage":{"id":"employee-shift-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/scheduling/employee-shift-scheduling"},{"slug":"job-shop-scheduling","name":"Job-Shop Scheduling","summary":"Sequences jobs across machines so orders finish on time with minimal idle time.","applications":["Machining workshops","Print shops","Custom fabrication"],"objectives":["Makespan","Tardiness","Utilization"],"nativePackage":{"id":"job-shop-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling","assignment"],"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.","limitations":["No preemption","One machine per operation","Time discretization is explicit","No automatic optimality guarantee"]},"url":"http://suupmi.193.70.74.163.sslip.io/models/scheduling/job-shop-scheduling"},{"slug":"machine-scheduling","name":"Machine Scheduling","summary":"Orders work on parallel machines considering setups, speeds and maintenance windows.","applications":["Injection molding","Packaging lines","CNC cells"],"objectives":["Completion time","Setup cost","Throughput"],"nativePackage":{"id":"machine-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling","assignment"],"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.","limitations":["No preemption","One unary machine per job","No automatic optimality guarantee","Finite explicit time grid"]},"url":"http://suupmi.193.70.74.163.sslip.io/models/scheduling/machine-scheduling"},{"slug":"appointment-scheduling","name":"Appointment Scheduling","summary":"Books appointments into calendars to maximize capacity and minimize waiting.","applications":["Clinics","Field service visits","Vehicle inspections"],"objectives":["Utilization","Waiting time","No-show impact"],"nativePackage":{"id":"appointment-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/scheduling/appointment-scheduling"},{"slug":"maintenance-scheduling","name":"Maintenance Scheduling","summary":"Plans preventive maintenance to reduce downtime and spread technician workload.","applications":["Fleet maintenance","Wind farms","Plant shutdowns"],"objectives":["Downtime","Maintenance cost","Risk"],"nativePackage":{"id":"maintenance-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/scheduling/maintenance-scheduling"},{"slug":"project-scheduling","name":"Project Scheduling","summary":"Schedules project activities under precedence and shared resource limits.","applications":["Construction","Engineering projects","R&D portfolios"],"objectives":["Project duration","Resource leveling","Cost"],"nativePackage":{"id":"project-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/scheduling/project-scheduling"}]},{"slug":"energy","name":"Energy","description":"Decide when to charge, discharge, buy, produce or shift energy across prices, forecasts and physical limits.","models":[{"slug":"battery-energy-storage-optimization","name":"Battery Energy Storage Optimization","summary":"Decides when a battery should charge and discharge to cut costs or earn revenue.","applications":["Behind-the-meter storage","Grid-scale arbitrage","Peak shaving"],"objectives":["Energy cost","Revenue","Battery degradation"],"url":"http://suupmi.193.70.74.163.sslip.io/models/energy/battery-energy-storage-optimization"},{"slug":"economic-dispatch","name":"Economic Dispatch","summary":"Allocates output across generators to meet demand at the lowest cost.","applications":["Utilities","Industrial CHP","Island grids"],"objectives":["Generation cost","Emissions","Reserve margin"],"url":"http://suupmi.193.70.74.163.sslip.io/models/energy/economic-dispatch"},{"slug":"microgrid-optimization","name":"Microgrid Optimization","summary":"Coordinates solar, storage, generators and loads within a local grid.","applications":["Campuses","Remote sites","Data centers"],"objectives":["Cost","Self-consumption","Resilience"],"url":"http://suupmi.193.70.74.163.sslip.io/models/energy/microgrid-optimization"},{"slug":"ev-charging-scheduling","name":"EV Charging Scheduling","summary":"Plans electric vehicle charging within grid limits and departure times.","applications":["Fleet depots","Workplace charging","Charge-point operators"],"objectives":["Energy cost","Peak demand","Charging completion"],"url":"http://suupmi.193.70.74.163.sslip.io/models/energy/ev-charging-scheduling"},{"slug":"energy-procurement-optimization","name":"Energy Procurement Optimization","summary":"Chooses the best mix of contracts and spot purchases for expected demand.","applications":["Industrial buyers","Retailers","Municipalities"],"objectives":["Procurement cost","Price risk"],"url":"http://suupmi.193.70.74.163.sslip.io/models/energy/energy-procurement-optimization"},{"slug":"demand-response-optimization","name":"Demand Response Optimization","summary":"Shifts flexible loads to respond to grid signals and price peaks.","applications":["HVAC portfolios","Cold storage","Water pumping"],"objectives":["Flexibility revenue","Comfort","Energy cost"],"url":"http://suupmi.193.70.74.163.sslip.io/models/energy/demand-response-optimization"}]},{"slug":"routing-logistics","name":"Routing & Logistics","description":"Plan routes, fleets and deliveries that respect time windows, capacities and driver rules.","models":[{"slug":"vehicle-routing","name":"Vehicle Routing","summary":"Plans the best sequence of stops for each vehicle in a fleet.","applications":["Last-mile delivery","Field service","Waste collection"],"objectives":["Distance","Vehicles used","Lateness"],"nativePackage":{"id":"vehicle-routing","version":"1.1.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["routing"],"scope":"Closed, open or specified-endpoint routes and atomic pickup-delivery requests with multidimensional onboard capacity, eligibility and service windows.","limitations":["Heuristic search; no optimality or infeasibility proof","Pickup-delivery requests use distinct unit visits, paired acceptance, one vehicle and zero initial load; no split deliveries, depot reloading, multi-trip, FIFO/LIFO, driver breaks or drone synchronization.","Aggregate capacity and onboard loadCapacity are separate constraints. Routing pickup-delivery cannot be combined with allocation."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/routing-logistics/vehicle-routing"},{"slug":"fleet-assignment","name":"Fleet Assignment","summary":"Matches vehicle types to trips or routes based on cost and capacity.","applications":["Bus operators","Trucking","Airlines"],"objectives":["Operating cost","Utilization"],"nativePackage":{"id":"fleet-assignment","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/routing-logistics/fleet-assignment"},{"slug":"delivery-scheduling","name":"Delivery Scheduling","summary":"Assigns delivery slots and dates to orders to balance daily capacity.","applications":["E-commerce","Furniture delivery","Grocery"],"objectives":["Capacity balance","Customer preference","Cost"],"nativePackage":{"id":"delivery-scheduling","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["assignment"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/routing-logistics/delivery-scheduling"},{"slug":"shipment-consolidation","name":"Shipment Consolidation","summary":"Groups orders into fewer, fuller shipments to reduce freight cost.","applications":["Freight forwarders","Wholesale","3PL"],"objectives":["Freight cost","Load factor","Service level"],"nativePackage":{"id":"shipment-consolidation","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["packing"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/routing-logistics/shipment-consolidation"},{"slug":"warehouse-operations","name":"Warehouse Operations","summary":"Optimizes picking, slotting and wave planning inside the warehouse.","applications":["Fulfilment centers","Cold chain","Spare parts"],"objectives":["Travel distance","Throughput","Labor"],"nativePackage":{"id":"warehouse-operations","version":"1.1.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["assignment","scheduling","routing"],"scope":"Slotting, waves or picking workflows; picking supports explicit endpoints and atomic pickup-delivery requests with onboard capacity.","limitations":["Heuristic search; no optimality or infeasibility proof","Pickup-delivery requests use distinct unit visits, paired acceptance, one vehicle and zero initial load; no split deliveries, depot reloading, multi-trip, FIFO/LIFO, driver breaks or drone synchronization.","Aggregate capacity and onboard loadCapacity are separate constraints. Routing pickup-delivery cannot be combined with allocation."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/routing-logistics/warehouse-operations"}]},{"slug":"production-manufacturing","name":"Production & Manufacturing","description":"Plan what to produce, how much and when, given capacity, materials, setups and demand.","models":[{"slug":"production-planning","name":"Production Planning","summary":"Builds multi-period production plans that meet demand within capacity.","applications":["Discrete manufacturing","Process industries","Contract manufacturers"],"objectives":["Total cost","Service level","Capacity use"],"url":"http://suupmi.193.70.74.163.sslip.io/models/production-manufacturing/production-planning"},{"slug":"lot-sizing","name":"Lot Sizing","summary":"Determines batch sizes that balance setup costs against inventory.","applications":["Food & beverage","Chemicals","Pharma"],"objectives":["Setup cost","Holding cost"],"url":"http://suupmi.193.70.74.163.sslip.io/models/production-manufacturing/lot-sizing"},{"slug":"production-mix-optimization","name":"Production Mix Optimization","summary":"Chooses which products to make to maximize margin under constraints.","applications":["Refining","Agri-food","Metals"],"objectives":["Margin","Resource usage"],"url":"http://suupmi.193.70.74.163.sslip.io/models/production-manufacturing/production-mix-optimization"},{"slug":"cutting-stock","name":"Cutting Stock","summary":"Cuts rolls, bars or sheets into required pieces with minimal waste.","applications":["Paper & film","Steel","Timber"],"objectives":["Material waste","Number of patterns"],"url":"http://suupmi.193.70.74.163.sslip.io/models/production-manufacturing/cutting-stock"},{"slug":"assembly-line-balancing","name":"Assembly Line Balancing","summary":"Distributes tasks across workstations to hit target cycle times.","applications":["Automotive","Electronics","Appliances"],"objectives":["Cycle time","Stations","Balance"],"url":"http://suupmi.193.70.74.163.sslip.io/models/production-manufacturing/assembly-line-balancing"}]},{"slug":"assignment-resource-allocation","name":"Assignment & Resource Allocation","description":"Match people, budgets, sites and capacity to tasks and demand under business rules.","models":[{"slug":"workforce-assignment","name":"Workforce Assignment","summary":"Assigns people to tasks or projects based on skills, cost and availability.","applications":["Consulting","Field service","Healthcare"],"objectives":["Cost","Skill match","Workload balance"],"nativePackage":{"id":"workforce-assignment","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/assignment-resource-allocation/workforce-assignment"},{"slug":"resource-allocation","name":"Resource Allocation","summary":"Distributes limited budget or capacity across competing demands.","applications":["Marketing budgets","IT capacity","Public services"],"objectives":["Value","Cost","Coverage"],"nativePackage":{"id":"resource-allocation","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["allocation"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/assignment-resource-allocation/resource-allocation"},{"slug":"facility-location","name":"Facility Location","summary":"Chooses where to open sites to serve customers at the lowest total cost.","applications":["Warehouses","Retail stores","Charging hubs"],"objectives":["Total cost","Coverage","Travel time"],"nativePackage":{"id":"facility-location","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["assignment"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/assignment-resource-allocation/facility-location"},{"slug":"capacity-allocation","name":"Capacity Allocation","summary":"Allocates shared capacity among customers, products or channels.","applications":["Telecom","Hotels","Manufacturing"],"objectives":["Revenue","Fill rate"],"nativePackage":{"id":"capacity-allocation","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["allocation"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/assignment-resource-allocation/capacity-allocation"},{"slug":"task-assignment","name":"Task Assignment","summary":"Matches individual tasks to agents in real time or in batches.","applications":["Ticket routing","Gig platforms","AI agent swarms"],"objectives":["Completion time","Cost","Quality"],"nativePackage":{"id":"task-assignment","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["scheduling"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/assignment-resource-allocation/task-assignment"}]},{"slug":"inventory-supply-chain","name":"Inventory & Supply Chain","description":"Decide order quantities, stock levels, suppliers and network structure across your supply chain.","models":[{"slug":"inventory-replenishment","name":"Inventory Replenishment","summary":"Recommends when and how much to reorder for each item.","applications":["Retail","Spare parts","Distribution"],"objectives":["Inventory cost","Service level","Stockouts"],"url":"http://suupmi.193.70.74.163.sslip.io/models/inventory-supply-chain/inventory-replenishment"},{"slug":"multi-echelon-inventory-optimization","name":"Multi-Echelon Inventory Optimization","summary":"Sets stock targets across warehouses and stores together.","applications":["Retail networks","Aftermarket parts","Pharma distribution"],"objectives":["Network inventory","Service level"],"url":"http://suupmi.193.70.74.163.sslip.io/models/inventory-supply-chain/multi-echelon-inventory-optimization"},{"slug":"supplier-selection","name":"Supplier Selection","summary":"Chooses suppliers and order splits based on price, capacity and risk.","applications":["Procurement","Manufacturing","Construction"],"objectives":["Purchase cost","Risk","Lead time"],"url":"http://suupmi.193.70.74.163.sslip.io/models/inventory-supply-chain/supplier-selection"},{"slug":"distribution-network-design","name":"Distribution Network Design","summary":"Designs which facilities and flows form the best distribution network.","applications":["Market expansion","Network consolidation","Nearshoring"],"objectives":["Total landed cost","Service time"],"url":"http://suupmi.193.70.74.163.sslip.io/models/inventory-supply-chain/distribution-network-design"}]},{"slug":"packing-loading","name":"Packing & Loading","description":"Pack items into bins, containers, sheets and vehicles respecting dimensions, weight and stacking rules.","models":[{"slug":"bin-packing","name":"Bin Packing","summary":"Packs items into the fewest boxes or bins possible.","applications":["E-commerce cartonization","Cloud VM placement","Batching"],"objectives":["Bins used","Fill rate"],"nativePackage":{"id":"bin-packing","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["packing"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/packing-loading/bin-packing"},{"slug":"container-loading","name":"Container Loading","summary":"Builds 3D load plans for containers, trucks and pallets.","applications":["Freight forwarding","Exporters","Pallet building"],"objectives":["Volume use","Weight balance","Containers used"],"nativePackage":{"id":"container-loading","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["packing"],"scope":"Orthogonal 3D loading with rotations, nonoverlap, support, weight limits and optional center-of-mass bounds.","limitations":["No optimality guarantee; construction can leave feasible items unplaced","Axis-aligned rectangles/boxes only; size and position use x,y,z with vertical z","No irregular shapes, guillotine cuts, axle reactions or dynamic stability; center-of-mass bounds assume uniform density within each item","3D stacks require full support on a single lower box and propagate supported weights; no bridges or mechanical stability prediction"]},"url":"http://suupmi.193.70.74.163.sslip.io/models/packing-loading/container-loading"},{"slug":"two-dimensional-cutting","name":"Two-Dimensional Cutting","summary":"Nests rectangular parts on sheets to minimize offcuts.","applications":["Glass","Furniture panels","Sheet metal"],"objectives":["Material waste","Cut complexity"],"nativePackage":{"id":"two-dimensional-cutting","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["packing"],"scope":"Orthogonal rectangular placement with explicit rotations, nonoverlap, boundaries, eligibility, weight and horizontal clearance.","limitations":["No optimality guarantee; construction can leave feasible items unplaced","Axis-aligned rectangles/boxes only; size and position use x,y","No irregular shapes, cut sequence, guillotine-cut or center-of-mass/axle balance constraints","3D stacks require full support on a single lower box and propagate supported weights; no bridges or mechanical stability prediction"]},"url":"http://suupmi.193.70.74.163.sslip.io/models/packing-loading/two-dimensional-cutting"},{"slug":"cargo-allocation","name":"Cargo Allocation","summary":"Allocates shipments to available vehicles, flights or vessels.","applications":["Air cargo","Shipping lines","Rail freight"],"objectives":["Revenue","Capacity use"],"nativePackage":{"id":"cargo-allocation","version":"1.0.0","engine":"Crona C++","status":"release-candidate; check deployed API discovery","families":["allocation"],"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.","limitations":["Heuristic search; no optimality or infeasibility proof","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."]},"url":"http://suupmi.193.70.74.163.sslip.io/models/packing-loading/cargo-allocation"}]}]}