Microsoft · Filed May 23, 2025 · Published Oct 22, 2026

Microsoft Files Patent to Schedule Around Double-Booked Jobs Instead of Giving Up

Most scheduling software gives up when a customer locks in two appointments that cannot both happen. Microsoft's filing describes software that boxes in the clash and plans everything else around it.

Conflicting tasks within worker shifts are merged into single blocks of time so software can resolve double bookings without failing. Drawing from patent filing US 2026/0330346 A1.
Conflicting tasks within worker shifts are merged into single blocks of time so software can resolve double bookings without failing.
See all 14 drawings from this filing ↓
Publication number US 2026/0330346 A1 US20260330346A1
Applicant Microsoft Technology Licensing, LLC
Filing date May 23, 2025
Publication date Oct 22, 2026
Inventors David Shigeru TANIGUCHI, Hung-chih YANG, Chenlei FANG, Stephanie Rosenthal POMERANTZ, Atulya RAVISHANKAR, Ning GAO, Christopher Patrick MUIR, Zachary Ben RUBINSTEIN, Ronit BOHRER HILLEL
US classification 705/7.13
Examiner BYRD, UCHE SOWANDE (Art Unit 3624)
Status when we published Examiner raised objections; the company can respond (Jul 28, 2026)
Parent application Claims priority from a provisional application 63789576 (filed 2025-04-16)
Document 20 claims

What Microsoft's double-booking fix does

Imagine you run a plumbing company, and a dispatcher has locked in two do not move appointments for the same plumber at the same hour, on opposite sides of town. Many scheduling tools either choke on that or refuse to build any schedule at all.

Microsoft's patent application describes a way around it. The software spots the clash, wraps the conflicting appointments into one placeholder block of time, and plans the rest of the day around it. Your plumber still gets a workable schedule, and the clash goes back to a human instead of breaking the whole plan.

The filing also tackles size. When a company has a thousand jobs and dozens of workers, the software first sorts jobs into geographic groups, gives each group some work shifts, and solves the small pieces separately.

From the filing · THE ABSTRACT
Some embodiments utilize virtual bookings to produce a partial schedule instead of declining to produce any schedule which involves conflicts.

Translation: The system makes tentative placeholder bookings to build a workable partial schedule when conflicts arise instead of giving up.

How jobs get sorted into location groups

The filing covers scheduling software for companies that send workers to jobs, such as plumbers or field technicians. The main claim is about splitting a huge scheduling problem into smaller ones by location. That matters because solving a schedule slows down fast as jobs pile up. In the filing's own test, 50 shifts and 1,300 requirements took about 219 seconds, while a problem half that size took about 46.

The location-based steps work like this:

  • Cluster the jobs by where they are, using standard grouping methods (algorithms that bunch nearby points together).
  • Size each cluster's workload from job time plus travel time, then give it a matching share of the available work shifts.
  • Score coverage, meaning how many jobs in a cluster have at least one eligible shift in the same cluster, and swap shifts between clusters to raise that score.

The second idea handles bad input. Customers sometimes lock in appointments that cannot all happen, such as overlaps or too little travel time between sites. The software finds these, merges them into one virtual booking (a placeholder block of time), and keeps other jobs out of that window. Bookings outside any work shift are marked unschedulable and handed back unchanged.

The filing also describes a chat feature where a language model explains why two bookings overlap, plus a summary of the most frequent data conflicts.

Why messy customer data matters for dispatch

If you have ever had a repair visit shuffled for no clear reason, you have met this problem. Customers and dispatchers edit schedules by hand, and those edits can create impossible plans. Software that refuses to schedule anything leaves a dispatcher stuck, while software that plans around the clash keeps technicians moving. The filing ties the work to an internal scheduling agent in Microsoft's Frontline business software, so the audience is companies, not consumers.

The application is early in the process. The examiner's first review rejected the claims as filed, which is routine and usually followed by amendments, so the final scope may look different. The feature you would most likely notice is the chat helper that answers why is my schedule like this? in plain language.

Microsoft's 543rd filing in our Microsoft coverage since May adds to a security run that includes dual AI server checks and plain-language database search.

Editorial take

The problem here is costly. Scheduling gets slower as jobs pile up, and every company that sends out workers has customers or dispatchers who book things that cannot happen. A system that stops cold on one bad appointment burns working hours, so boxing in the mess and scheduling around it fits the size of the problem well.

The location grouping is the more ambitious half. Splitting a big job list into neighborhoods will sometimes cost a slightly worse schedule, and the filing admits as much. Trading a little quality for a plan that arrives in seconds is a fair deal for a company managing hundreds of visits a day.

Most of this is careful engineering for businesses, with little for everyday users to notice. Still, a plan that handles human error gracefully beats one that demands perfect input.

Get our take in your Top Stories

Liked this breakdown? Add Patentlyze as a preferred source on Google, and our plain-English take shows up more often in your Top Stories the next time Microsoft patent news breaks.

There are more where this came from

We read every patent application Big Tech publishes and send you the ones worth knowing. Plain English, free, every week.

The drawings

14 drawing sheets from US 2026/0330346 A1 · click any drawing to enlarge

Cloud servers and data records that organize incoming tasks, drawing sheet 1 from US 2026/0330346 A1
Sheet 1 Cloud servers and data records that organize incoming tasks
Rules and resources including workers and delivery drones, drawing sheet 2 from US 2026/0330346 A1
Sheet 2 Rules and resources including workers and delivery drones
Filtering and reinserting tasks into a workable roster, drawing sheet 3 from US 2026/0330346 A1
Sheet 3 Filtering and reinserting tasks into a workable roster
Grouping nearby tasks by map location to build shifts, drawing sheet 4 from US 2026/0330346 A1
Sheet 4 Grouping nearby tasks by map location to build shifts
Spotting schedule conflicts and merging them into placeholder tasks, drawing sheet 5 from US 2026/0330346 A1
Sheet 5 Spotting schedule conflicts and merging them into placeholder tasks
Answering manager questions about why tasks were double booked, drawing sheet 6 from US 2026/0330346 A1
Sheet 6 Answering manager questions about why tasks were double booked
Converting impossible overlapping assignments into single combined blocks, drawing sheet 7 from US 2026/0330346 A1
Sheet 7 Converting impossible overlapping assignments into single combined blocks
Adjusting shift end times when tasks run over depot hours, drawing sheet 8 from US 2026/0330346 A1
Sheet 8 Adjusting shift end times when tasks run over depot hours
Show the other 6 sheets
Shrinking shifts when conflicting jobs spill past the depot, drawing sheet 9 from US 2026/0330346 A1
Sheet 9 Shrinking shifts when conflicting jobs spill past the depot
Merging double bookings that overlap across two separate shifts, drawing sheet 10 from US 2026/0330346 A1
Sheet 10 Merging double bookings that overlap across two separate shifts
Grouping workers and jobs into independent clusters, drawing sheet 11 from US 2026/0330346 A1
Sheet 11 Grouping workers and jobs into independent clusters
Handling trips with impossible travel times between stops, drawing sheet 12 from US 2026/0330346 A1
Sheet 12 Handling trips with impossible travel times between stops
Reorganizing worker shifts around tasks already underway, drawing sheet 13 from US 2026/0330346 A1
Sheet 13 Reorganizing worker shifts around tasks already underway
Fixing travel gaps between locked appointments across a day, drawing sheet 14 from US 2026/0330346 A1
Sheet 14 Fixing travel gaps between locked appointments across a day
Browse all the drawings 14 drawing sheets
Patent filing page

Source. Full patent text and figures from the official USPTO publication PDF.
Reader comments

Be the first to weigh in

Start the discussion

Real name or a handle, either is fine. Comments are read by a person before they appear, so allow a little time. Keep it about the filing.