Shiftto

How Automatic Shift Scheduling Works in Shiftto

Published: October 9, 2026 / Last updated: October 13, 2026

Shiftto's main feature is that it builds the shift table automatically from the responses you collect. Here is what it prioritizes, under which conditions, and how far you can trust it, written to match the implementation.

Input and output

The input is the slots, roles and headcounts set by the organizer and the ○△× answered by participants. The output is a draft of who goes into which role in which slot, plus a list of slots that are short of people.

Also fed in as conditions are the cap on slots per person, the cap per day, the cap on consecutive slots, roles people declared they can't do, and assignments the organizer has pinned. The more conditions you enter, the less room the machine has to decide, but the less there is to fix by hand afterward.

Conditions that are always kept

  • Nobody is placed in a slot they answered ×
  • Nobody gets more than one role in the same slot
  • Nobody is placed in a role they declared they can't do
  • Nobody exceeds their limit on the number of slots
  • The daily limit and the limit on consecutive slots are not exceeded
  • Assignments pinned by the organizer are not moved

Even when people are short, none of these is broken. A short slot is shown as short. Forcing a slot full by placing someone who said × or who is over their limit would give you a table that can't work on the day.

What it minimizes

Within those conditions, it adjusts to reduce the following. The higher in the list, the higher the priority (imbalance and fragmentation carry the same weight).

  1. Shortages. Top priority, weighted far more heavily than the rest.
  2. The number of △ slots used.
  3. Imbalance in slots per person. It narrows the gap between the busiest and the least busy person.
  4. Fragmentation. It groups a person's work into consecutive slots rather than scattered ones.
  5. Role switching. It avoids making the same person change roles repeatedly.

Shortage is weighted so heavily because a single unfilled slot can stop things on the floor. It prefers to fill the slot even if that costs a little balance.

How the assignment proceeds

There are two stages. First it places people one by one, prioritizing slots that are short, to build an initial draft. This is called a greedy method.

Then it repeatedly tries small changes, such as swapping two people's shifts or moving someone to another slot, and keeps only the changes that improve the score above. This is called local search.

A small example

Four people (A to D) cover three one-hour slots from 10:00 to 13:00, two people per slot. Suppose the answers are as follows.

10-1111-1212-13
A○○×
B○△○
C×○○
D○×○

The slots needed in total are 2 × 3 = 6, which is 1.5 per person across four people. A draft such as A and D at 10-11, A and C at 11-12, and B and C at 12-13 has no shortage, uses no △, and gives 2, 1, 2 and 1 slots, a gap of just one. A works 10-12 in a row, so nothing is fragmented either.

If C marked 11-12 as ×, the only people who could go into that slot would be A with ○ and B with △. Since it prefers using a △ to leaving a shortage, B's △ slot gets used. In this way the machine compares the whole set of slot-and-person combinations by which scores better.

Why it is not perfect

It does not search exactly for the optimal solution. With many participants and slots, we prioritized returning a result quickly. So results can differ slightly from run to run, and depending on the conditions the draft may not be the best possible one.

Also, if too few people answer, slots stay empty. Auto-assignment is a tool for arranging well within the collected availability. It cannot create more availability.

The machine also doesn't know personal circumstances. If you always want the leader in the peak slot, or a newcomer in the same slot as an experienced person, put them in by hand and pin them. Pinned slots don't move when you re-run the assignment.

When a slot is short

Short slots are shown with a red background and a warning icon. There are three ways to deal with them: ask people who might be free to add answers, add people by hand from the table cells, or pin the assignments you like and reassign only the rest.

If you really can't fill it, revisit the required headcount. Assigning again with a setting that has no slack only leaves the same slots short. How to set headcounts is covered in the article on building shifts by role.

Using it

The organizer creates the event and hands out the URL. Once responses are in, press the auto-assignment button on the admin screen. You can check the result in the table, edit it and run it again. No sign-up or login, and it is free.

You can see what the resulting table looks like on the demo page, which shows the output of running the assignment described here on sample answers.

Collect availability and build the shifts automatically

No sign-up or login. Free, and ready in 5 minutes.

Create a shift

Related articles

See all articles