● Solutions
Decisions with too many combinations to try by hand.
22 working models across four families. Each has named constraints, tests, and benchmarks against established solvers such as OR-Tools. Constraints and preferences are plugins — most real projects start from one model, switch off what does not apply and plug in the rules that make your operation yours.
01
Routing & Logistics
Who drives where, in what order, with what on board. Routing is where most of our experience comes from — parcel delivery, B2B freight and real-time food dispatch.
Learn more →- Vehicle routing (VRP) Assign visits to vehicles and order them into routes, respecting capacities and time windows while minimizing travel.
- Pickup & delivery (PDPTW) Each request is a pickup and a drop-off served by the same vehicle, pickup first, without ever exceeding capacity in between.
- Order picking Batch pick tasks onto trolleys and sequence them through the aisles so pickers walk less and trolleys stay within volume.
- Facility location Choose which sites to open and which customers each serves, trading setup cost against distance under capacity limits.
02
Scheduling
People, machines and jobs on a timeline. Rosters that respect labor rules and preferences; production plans that respect setups, precedences and due dates.
Learn more →- Employee & nurse rostering Fill every shift with a qualified person while honoring rest rules, weekly hour limits, consecutive-day limits and individual preferences.
- Flight crew scheduling Staff every seat on every flight with crew who hold the right qualification, without overlaps and with feasible connections.
- Maintenance scheduling Pick a crew and a start date for each maintenance job so that work is neither too early nor too late and crews are never double-booked.
- Project scheduling (RCPSP) Sequence project activities under precedence and shared resource limits, choosing an execution mode for each, to finish as early as possible.
- Semiconductor fab scheduling Route re-entrant lots through alternative tools with recipe setups, batching, queue-time limits, maintenance windows and due dates.
- Production line sequencing Sequence packaging jobs on production lines, accounting for product-dependent cleaning time and operators shared across lines.
- Task assignment Build an ordered work queue for each person, matching skills and affinity and finishing critical work first.
- Meeting scheduling Place meetings in time and rooms so that required attendees can come, rooms are big enough and nothing overlaps.
03
Timetabling
Fixed grids, many stakeholders, little slack. Timetables are where constraint quality matters most — and where a good one saves weeks of manual work every term.
Learn more →- School timetabling Assign every lesson to a period and a room with no teacher, class or room conflicts, then polish for gaps, consecutive lessons and teacher wishes.
- Conference scheduling Place talks into timeslots and rooms, keeping speakers available, themes apart and popular talks in big rooms.
- Sports league scheduling Assign every match to a round, limiting travel and long home or away streaks.
- Tournament scheduling Spread teams over tournament days so that load stays balanced and every team gets a fair schedule.
04
Allocation & Packing
Put things in the right place: patients in beds, items in containers, tasks on stations. Classic models, real-world side constraints.
Learn more →- Hospital bed allocation Assign patient stays to beds, respecting gender rules, required equipment and room preferences, without double-booking.
- Bin packing Pack items into as few bins as possible without overloading any of them.
- Knapsack & selection Choose the most valuable subset under one or more budgets, with mandatory items, dependencies and group limits.
- Assembly line balancing Assign tasks to stations along a line so that precedence holds and no station exceeds the cycle time.
- Quadratic assignment Place facilities in locations so that heavy flows travel short distances — layouts, wiring and slotting.
- Max-cut & partitioning Split a weighted graph into two sides to maximize the weight crossing between them, with balance and pairing rules.
How a project goes
- 01
Rules first
We write down your hard rules and preferences in plain language before any code.
- 02
Model
We start from the closest use case and plug in, remove or reweight constraints for your case.
- 03
Prove it
On your own data, we compare against your current plans and established solvers such as OR-Tools.
- 04
Ship
Run it as a Python package, inside your service, or behind our API.