For operations teams covering several buildings with one crew
Schedule the right people across every site
Multi-site planning adds two things a single-site rota has no model for: permission to work at a place, and enough time to get between two of them. Both are hard rules, and travel time you have not stated is never assumed to be zero.
- Journeys are asymmetric
- A permitted-sites list is a hard boundary
- Unknown stays unknown
Two directions, three answers, and one of them is “we don’t know”
Three sites, the minutes between them as the roster actually holds them, and the permitted-sites list that decides who may be considered at all.
| From site | To North | To South | To Depot |
|---|---|---|---|
| Northgate Centre | — | 35 min | 18 min est. |
| Southgate Retail Park | 50 min | — | not set |
| Depot | 18 min est. | not set | — |
Who may work where
- Anna SildBased at NorthMay work at North
- Marek KaskBased at NorthMay work at North, South
- Pia LepikBased at NorthMay work at North
- Liis IlvesBased at SouthEvery site — the list is empty, which means all
- Jaan SaarBased at SouthMay work at South
- Hele LillBased at SouthMay work at South
- Kaisa PärnBased at DepotMay work at Depot, North
How location changes the roster
A site is a place; a post is a responsibility at it
Posts inside one building are not journeys. The travel rule only ever fires between two different sites, which is what stops a five-minute walk being scheduled as a commute.
A permitted-sites list is a hard boundary
Where access, induction or contract scope limits where somebody may work, name the sites explicitly. An empty list means every site is allowed — it never means none, and that is the one place in the model where blank is permissive.
Travel resolves in a fixed order
A stated origin-to-destination figure wins; failing that, coordinate distance converted at a speed you set; failing that, unknown. You can switch the estimate off entirely when you would rather have unknown than a guess.
The gap is checked on the person, not the contract
Two contracts held by one person share one timeline, and history from before the period is included — so a cross-site collision at the boundary of a planning period cannot hide behind a second contract id.
It ranks people, it does not route vehicles
Fivexer constrains and ranks who can work where. It does not sequence stops or optimise a driving route, and no page here will imply that it does.
What this page will not claim
It does
- Enforce a permitted-sites list as a hard boundary, on the person rather than the contract
- Hold a gap between two shifts long enough for the journey you stated
- Keep an unstated journey visibly unknown, and say which pairs it skipped
It does not
- Sequence stops or optimise a driving route — this is not a route-optimisation product
- Count travel time as working time
- Infer a distance you have not given it, unless you set a speed to convert with
Not for you if
- Everybody works one building
- Your sites are close enough that travel never decides anything
- You need vehicle routing or dispatch by drive time
Questions we get asked first
Can one worker be scheduled across several sites in a week?
Yes, provided each site is permitted for them and the interval between consecutive shifts is long enough for the known journey. Both are hard rules the solver and the compliance check share.
Why are travel times asymmetric?
Because journeys are. The morning trip into a city and the evening trip out of it often differ, so travel is stated per direction rather than as one distance between two points.
What happens if we have not entered a travel time?
The journey is unknown, and it stays visibly unknown. Fivexer will estimate from coordinates if you give it a speed to convert with; if you do not, the travel-gap rule skips that pair rather than inventing a number.
Does Fivexer optimise driving routes between jobs?
No. It ranks and constrains which worker can be allocated where, using travel time as a scheduling constraint. It does not sequence vehicle stops, and it is not a route-optimisation product.