Is the scheduling of oncall work something worth making better?

All of us who have worked oncall for years, know how stressful and difficult it can be. Among all the pain though, I&#x27;ve always felt that the scheduling of who-works-when is something which should be solvable in a great way. I&#x27;ve tried to build something which solves oncall scheduling. This post is a shameless plug for that thing. But besides trying to get someone to click on the link, I would also love to get some feedback and hear some input from all of you who work oncall. Is the scheduling painful enough to be worth my time to solve? What I&#x27;ve tried to do with this tool is: Make the scheduling FAIR. There&#x27;s math and an algorithm deciding the schedule. All scheduling actions are available for all to see in a log. Make the people who get scheduled have great CONTROL over when they work or (more importantly) _don&#x27;t_ work. Maintain a PREDICTABLE and STABLE schedule at least several months into the future, which doesn&#x27;t get all scrambled if someone leaves the team and their shifts become holes in the schedule. Make the scheduling FULLY AUTOMATED so nobody needs to think about it more than at most once&#x2F;quarter.<p>What do you think? Is this a problem worth trying to solve for real? If you look into the tool, do you think it looks like a good solution, or does it miss the mark somehow?

To the author: what is the algorithmic approach to determine a schedule?<p>Once you add a couple of constraints or complications (e.g. can&#x27;t be on-call two nights in a row, or on-call weekends count 1.5x because they are more &quot;painful&quot;), it quickly becomes a fairly general constraint satisfaction problem. This is a field with deep mathematics involved and decades of academic literature. As far as I know, reaching the state-of-the-art is extremely hard, and it is usually advised to use an off-the-shelf solver (a SAT [1] solver, or a constraint-programming solver like Gecode [2], or something more specific like OptaPlanner&#x2F;TimeFold [3]).<p>If in addition you introduce happiness and&#x2F;or fairness maximization, then you may want optimality guarantees, and then you need a full-blown MIP solver (which means slower solves, and the faster MIP solvers are expensive).<p>That said, the model used here seems to have a special structure, so a custom (greedy?) algorithm may make sense. Any pointer for more details on the model?<p>[1] <a href="http:&#x2F;&#x2F;www.satcompetition.org" rel="nofollow">http:&#x2F;&#x2F;www.satcompetition.org</a><p>[2] <a href="https:&#x2F;&#x2F;www.gecode.org" rel="nofollow">https:&#x2F;&#x2F;www.gecode.org</a><p>[3] <a href="https:&#x2F;&#x2F;timefold.ai&#x2F;" rel="nofollow">https:&#x2F;&#x2F;timefold.ai&#x2F;</a>