IP Library Granted Patent US 12,632,286
Granted Patent B1
US 12,632,286 · App. 15/945,096 · Granted May 19, 2026

Dynamic task priority assignments in warehouse

Inventors: Vincent Raymond (Montréal, CA); Phillipe Grangier (Montréal, CA); Marc Brisson (Boucherville, CA); Steven Cheney (Waukesha, WI)
Assignee: Blue Yonder Group, Inc.
G06F9/4818G06F9/544
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,632,286
App. No.
15/945,096
Granted
May 19, 2026
Kind
B1
Abstract

A system and method are disclosed for a warehouse management system having a task database and a server comprising a processor and memory. The system groups one or more tasks from the task database into one or more groups, estimate the latest feasible start time for each group of the one or more groups and assigns a priority for the one or more tasks in each group based, at least in part, on the estimated latest feasible start time for each group.

Claims (52)

1 . A warehouse management system, comprising:

a task database and a server comprising a processor and memory, the server configured to:

receive product data from automated machinery having at least one sensor, wherein the product data corresponds to items detected by the automated machinery;

group one or more tasks from the task database into one or more groups;

estimate a latest feasible start time for each group of the one or more groups;

assign a priority based on a priority curve for the one or more tasks in each group based on the estimated latest feasible start time for each group, wherein the priority curve is generated using a piecewise linear approach;

determine the priority of a task and in response to a determination that the priority of the task is at a high priority, assign a worker a task that is not in the worker's work zone, wherein the worker comprises the automated machinery selected from the group consisting of robotic warehouse systems, robotic inventory systems, automated guided vehicles, mobile racking units, automated robotic production machinery, and robotic devices; and

communicate electronically over a network to assign the task to the automated machinery, wherein the automated machinery autonomously completes the task in response to the task assignment from the warehouse management system, and further wherein the task comprises adjusting inventory of the items at one or more stocking points.

2 . The warehouse management system of claim 1 , wherein a worker is assigned a task based on the priority associated with the task.

3 . The warehouse management system of claim 2 , wherein the priority curve comprises:

a base priority buffer;

a maximum priority buffer;

at least one intermediate priority buffer between the base priority buffer and the maximum priority buffer, wherein each buffer is associated with a range of values for a margin, the margin representing a difference between a current time and the latest feasible start time; and

a slope of the priority curve is different for at least two of the buffers.

4 . The warehouse management system of claim 3 , wherein each buffer represents one or more work zones in a warehouse.

5 . The warehouse management system of claim 1 , wherein the server is further configured to:

link related tasks by grouping at least two separate tasks when the at least two tasks are to pick two items from inventory and the two items are a same item;

assign the linked related task to the worker to pick the two items at a same time.

6 . A computer-implemented method, comprising:

receiving product data from automated machinery having at least one sensor, wherein the product data corresponds to items detected by the automated machinery;

grouping one or more tasks from a task database into one or more groups;

estimating a latest feasible start time for each group of the one or more groups;

assigning a priority based on a priority curve for the one or more tasks in each group based on the estimated latest feasible start time for each group, wherein the priority curve is generated using a piecewise linear approach;

determining the priority of a task and in response to a determination that the priority of the task is at a high priority, assign a worker a task that is not in the worker's work zone, wherein the worker comprises the automated machinery selected from the group consisting of robotic warehouse systems, robotic inventory systems, automated guided vehicles, mobile racking units, automated robotic production machinery, and robotic devices; and

communicating electronically over a network from a warehouse management system to assign the task to the automated machinery, wherein the automated machinery is configured to autonomously completes the task in response to the task assignment from the warehouse management system, and further wherein the task comprises adjusting inventory of the items at one or more stocking points.

7 . The method of claim 6 , wherein a worker is assigned a task based on the priority associated with the task.

8 . The method of claim 6 , wherein the priority curve comprises:

a base priority buffer;

a maximum priority buffer;

at least one intermediate priority buffer between the base priority buffer and the maximum priority buffer, wherein each buffer is associated with a range of values for a margin, the margin representing a difference between a current time and the latest feasible start time; and

a slope of the priority curve is different for at least two of the buffers.

9 . The method of claim 8 , wherein each buffer represents one or more work zones in a warehouse.

10 . The method of claim 6 , further comprising:

linking related tasks by grouping at least two separate tasks when the at least two tasks are to pick two items from inventory and the two items are a same item;

assigning the linked related task to the worker to pick the two items at a same time.

11 . A non-transitory computer-readable medium embodied with software, the software when executed configured to:

receive product data from automated machinery having at least one sensor, wherein the product data corresponds to items detected by the automated machinery;

group one or more tasks from a task database into one or more groups;

estimate a latest feasible start time for each group of the one or more groups;

assign a priority based on a priority curve for the one or more tasks in each group based on the estimated latest feasible start time for each group, wherein the priority curve is generated using a piecewise linear approach;

determine the priority of a task and in response to a determination that the priority of the task is at a high priority, assign a worker a task that is not in the worker's work zone, wherein the worker comprises the automated machinery selected from the group consisting of robotic warehouse systems, robotic inventory systems, automated guided vehicles, mobile racking units, automated robotic production machinery, and robotic devices; and

communicate electronically over a network from a warehouse management system to assign the task to the automated machinery, wherein the automated machinery is configured to autonomously completes the task in response to the task assignment from the warehouse management system, and further wherein the task comprises adjusting inventory of the items at one or more stocking points.

12 . The non-transitory computer-readable medium of claim 11 , wherein a worker is assigned a task based on the priority associated with the task.

13 . The non-transitory computer-readable medium of claim 11 , wherein the priority curve comprises:

a base priority buffer;

a maximum priority buffer;

at least one intermediate priority buffer between the base priority buffer and the maximum priority buffer, wherein each buffer is associated with a range of values for a margin, the margin representing a difference between a current time and the latest feasible start time; and

a slope of the priority curve is different for at least two of the buffers.

14 . The non-transitory computer-readable medium of claim 13 , wherein each buffer represents one or more work zones in a warehouse.

15 . The non-transitory computer-readable medium of claim 11 , wherein the software when executed is further configured to:

link related tasks by grouping at least two separate tasks when the at least two tasks are to pick two items from inventory and the two items are a same item;

assign the linked related task to the worker to pick the two items at a same time.

Assignments (4)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053383/0117) Recorded Nov 3, 2021
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: BLUE YONDER GROUP, INC.
Reel/Frame 058794/0776 →
RELEASE OF SECURITY INTEREST Recorded Sep 16, 2021
From: JPMORGAN CHASE BANK, N.A.
To: BLUE YONDER GROUP, INC.; BLUE YONDER, INC.; JDA SOFTWARE SERVICES, INC.; I2 TECHNOLOGIES INTERNATIONAL SERVICES, LLC; MANUGISTICS SERVICES, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; REDPRAIRIE COLLABORATIVE FLOWCASTING GROUP, LLC; JDA SOFTWARE RUSSIA HOLDINGS, INC.; REDPRAIRIE SERVICES CORPORATION; BY BOND FINANCE, INC.; BY NETHERLANDS HOLDING, INC.; BY BENELUX HOLDING, INC.
Reel/Frame 057724/0593 →
SECURITY AGREEMENT Recorded Aug 3, 2020
From: BLUE YONDER GROUP, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 053383/0117 →
CHANGE OF NAME Recorded Apr 14, 2020
From: JDA SOFTWARE GROUP, INC.
To: BLUE YONDER GROUP, INC.
Reel/Frame 052393/0538 →
Continuity (1)
Provisional Application 62481234 · Apr 4, 2017
References Cited (33)
US 4145735A · Soga · 1979 [cited by examiner]
US 5984499A · Nourse · 1999 [cited by examiner]
US 6750766B1 · Heitner · 2004 [cited by examiner]
US 7099745B2 · Ebert · 2006 [cited by examiner]
US 7113915B1 · Montemayor · 2006 [cited by examiner]
US 7151973B1 · Moll · 2006 [cited by examiner]
US 7970639B2 · Vucina · 2011 [cited by examiner]
US 8225319B2 · Laithwaite · 2012 [cited by examiner]
US 8494673B2 · Miranda · 2013 [cited by examiner]
US 8776076B2 · Chi · 2014 [cited by examiner]
US 9141433B2 · Doyle · 2015 [cited by examiner]
US 9671776B1 · Beard · 2017 [cited by examiner]
US 10089586B2 · Vestal · 2018 [cited by examiner]
US 10162341B2 · Norman · 2018 [cited by examiner]
US 20050154625A1 · Chua · 2005 [cited by examiner]
US 20070094661A1 · Baird · 2007 [cited by examiner]
US 20070185754A1 · Schmidt · 2007 [cited by examiner]
US 20080134193A1 · Corley · 2008 [cited by examiner]
US 20090150209A1 · Levine · 2009 [cited by examiner]
US 20130151298A1 · Davis · 2013 [cited by examiner]
US 20140136255A1 · Grabovski · 2014 [cited by examiner]
US 20160364263A1 · Cao · 2016 [cited by examiner]
US 20180005173A1 · Elazary · 2018 [cited by examiner]
US 20180151946A1 · Grohman · 2018 [cited by examiner]
US 20180285149A1 · Bhandari · 2018 [cited by examiner]
CN 106295927A · 2017 [cited by examiner]
EP 3331668B1 · 2020 [cited by examiner]
Monori, Ákos. “Task assignment optimization in SAP Extended Warehouse Management.” (2008). (Year: 2008). [cited by examiner]
Zhang, Yu, and Lynne E. Parker. “Multi-robot task scheduling.” 2013 IEEE international conference on robotics and automation. IEEE, 2013. (Year: 2013). [cited by examiner]
Ulusoy, G., and Ü. Bilge. “Simultaneous scheduling of machines and automated guided vehicles.” The International Journal of Production Research 31.12 (1993): 2857-2873. (Year: 1993). [cited by examiner]
Briskorn, Dirk, Andreas Drexl, and Sönke Hartmann. “Inventory-based dispatching of automated guided vehicles on container terminals.” OR Spectrum 28.4 (2006): 611-630. (Year: 2006). [cited by examiner]
Van den Berg, Jeroen P., and Willem HM Zijm. “Models for warehouse management: Classification and examples.” International journal of production economics 59.1-3 (1999): 519-528. (Year: 1999). [cited by examiner]
Chung, Jaewoo, and Jose MA Tanchoco. “Material handling automation in production and warehouse systems.” Springer handbook of automation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 961-979. (Year: 2009). [cited by examiner]