Systems and computerized methods for item correlation and prioritization

A computer-implemented method for item correlation, comprising:

• receiving an indication of an order comprising at least one item;
• determining if the order is urgent based on an amount of time remaining until the items must ship to a customer;
• determining a location of each of a plurality of pickers;
• iteratively, for items in the order:
• identifying a picker closest to the item, the picker having a current job priority;
• correlating the closest picker and the item in a data structure;
• re-correlating, in the data structure, at least one mutable item previously correlated with the closest picker to an alternate picker in response to the current job priority not being urgent, wherein items previously correlated with the closest picker are sequenced in the data structure according to respective correlation times, with a first N items of the sequence being fixed, a remaining M items being mutable, and a length of the sequence being limited to N+M items;
• sending, to a user device of the closest picker, a location and item identifier associated with the item;
• and
• storing, in the data structure, a completion flag in correlation with the item upon receipt of an item-complete message from the user device indicating that the item has been picked;
• receiving a job-complete message from a user device of a picker among the plurality of pickers;
• counting a number of items correlated to the picker that have the completion flag;
• comparing the number of items to a success threshold to determine a failure;
• and
• sending a signal to lock the user device of the picker when a number of failures exceeds a failure threshold.

A computer-implemented method for item correlation, comprising:

• receiving an indication of an order comprising at least one item;
• determining a priority of the order based on an amount of time remaining until the items must ship to a customer;
• determining a location of each of a plurality of pickers;
• iteratively, for pending items of the order:
• accessing at least one data structure to determine a location of the pending item;
• determining a set of near pickers within a threshold distance to the location;
• accessing the at least one data structure to determine previous items correlated to each of the set of near pickers;
• removing from the set any near picker having a number of previous items greater than a queue threshold;
• adding, to the set, pickers within an expanded threshold distance in response to the set being empty after the removing of pickers;
• identifying, from the set of near pickers, a picker closest to the item in response to the priority being urgent;
• identifying, from the set of near pickers, a picker having a smallest queue distance in response to the priority being normal, wherein a queue distance represents how far a picker is from a nearest correlated item of the picker;
• correlating the pending item with the identified picker in the at least one data structure;
• sending, to a user device of the closest picker, a location and item identifier associated with the item;
• and
• storing, in the data structure, a completion flag in correlation with the item upon receipt of a message from the user device that the item has been picked.