Articles

Beyond the Schedule: How Plantime's Evolutionary Engine Fixes Shift Work

Plantime's dynamic scheduling engine guarantees 100% viable plans from the very first draft. Built constraint-driven and powered by Rust, it rapidly iterates through millions of valid pathways and learns from every edit you make.

May 11th, 20264 min read

Our dynamic scheduling engine guarantees 100% viable plans from the very first draft. Built constraint-driven from the ground up, it rapidly iterates through millions of inherently valid pathways to find your optimal setup. Powered by a predictive learning layer that adapts to your business-specific needs, the system gets smarter and more efficient every time you hit "publish".

Let's face it: creating a weekly shift roster is often one of the most annoying workflows in business. If you've ever tried to manually schedule a mid-to-large-sized workforce, you know the headache. You're balancing employee availability, strict labor laws, and fair workload distribution. In computer science, this is known as a combinatorial optimization problem — meaning: as your team grows, the number of possible schedules easily explodes into the billions.

Plantime employs robust and reliable Machine Learning (ML) algorithms to transform a tangled web of requirements into a flawless, compliant schedule in a matter of seconds. Furthermore, these ML algorithms are implemented in Rust, which gives us both a performance as well as a safety edge over our competition.

Traditional scheduling tools usually generate a completely random draft first and try to fix all the broken rules later. This leads to searching a large part of the solution space unnecessarily.

Valid from Epoch Zero

We treat scheduling as a constraint-driven search problem. Instead of asking "Is this schedule allowed?" after generating it, our engine builds its first generation of schedules — what we call "epoch zero" — so they are already viable. By guaranteeing a baseline level of structural validity from the very first draft, we slash the computational search space. Our engine doesn't waste time fixing broken rules but rather focuses entirely on finding your best possible week.

The Evolutionary Loop: Mutate and Breed

Once we have a starting population of viable schedules, Plantime applies an Evolutionary Algorithm to rapidly improve them. Using the raw speed and parallel processing power readily available when interfacing with modern hardware through Rust, the engine evaluates thousands of variations simultaneously. It "mutates" schedules by introducing controlled randomness to explore new pathways, and "breeds" high-performing schedules together, swapping shifts to combine the best traits of both into a single, improved plan.

Karma and the Operational Advantage of Fairness

Fair scheduling isn't easy to achieve, but it is essential for employees to feel comfortable at their workplace — which in turn provides an operational advantage. But how does an algorithm actually measure fairness? We built a digital "Karma" economy directly into the evaluation system. Employees naturally earn Karma by taking on less desirable shifts and spend it when they get highly requested time off. The system heavily penalizes schedules that ignore the preferences of workers with high Karma balances, effectively eliminating human bias and rewarding team members equitably over time.

Learning From Your Edits

Scheduling is rarely static. That's why Plantime features a predictive learning layer. Every time you make a manual adjustment (e.g. swapping an employee due to a last-minute cancellation), the system gathers signals. It learns your unwritten rules and tacit preferences, dynamically adjusting its parameters so the engine gets increasingly tailored to your specific business dynamics every single week.

Where the Law Meets the Code

Most importantly, hard constraints are non-negotiable. Whether it's the strict 14-hour individual span limit, the 11-hour minimum daily rest period, or intricate Sunday-work exceptions mandated by the Swiss Employment Act, our compliance engine embeds these complex labor laws directly into the optimization loop. Large mathematical penalties prevent non-compliant schedules from "surviving" if better options are available. If you would like to dive deeper into what kind of compliance we handle, check out our upcoming article on The Algorithmic Codification of the Swiss Employment Act.

Plantime handles the billions of calculations behind the scenes so you don't have to. Better scheduling starts here — and can leave you with less time creating rosters and more time doing the work your business was built to do.

Spend less time building rosters and more time running your business.


Works Cited