Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving a request for an order comprising one or more items; determining when the order is eligible for batch picking by finding one or more other orders comprising at least one of the one or more items; and when the order is determined to be eligible for batch picking with the one or more other orders: creating one or more clusters by clustering together (1) the at least one of the one or more items of the order and (2) the at least one of the one or more items of the one or more other orders; estimating, for each respective cluster of the one or more clusters, an estimated fulfillment time interval to make ready the order; and assigning each respective cluster of the one or more clusters to at least one respective picker of one or more respective pickers. Other embodiments are disclosed herein.

Abstract: Methods and systems and computer-readable media are provided for dual optimization of pick walk and tote fill rates in order picking. Embodiments provide improved order picking speed and quality by optimizing pick routing with consideration of both proximity constraints and tote value constraints. Tote value constraints can include constraints on carrying capacity, volume, size in a particular dimension, or weight capacity.

Abstract: A system for rush order fulfilment optimization is discussed. The system includes mobile devices that are each associated with a worker and a rush fulfillment engine executed by a computing system which dynamically updates a task queue of each worker upon receipt of a new rush order according to a task completion rate difference between an estimated task completion rate and the current task completion rate of the worker.

Abstract: Methods and systems and computer-readable media are provided for dual optimization of pick walk and tote fill rates in order picking. Embodiments provide improved order picking speed and quality by optimizing pick routing with consideration of both proximity constraints and tote value constraints. Tote value constraints can include constraints on carrying capacity, volume, size in a particular dimension, or weight capacity.

Abstract: A system for rush order fulfilment optimization is discussed. The system includes mobile devices that are each associated with a worker and a rush fulfillment engine executed by a computing system which dynamically updates a task queue of each worker upon receipt of a new rush order according to a task completion rate difference between an estimated task completion rate and the current task completion rate of the worker.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving a request for an order comprising one or more items; determining when the order is eligible for batch picking by finding one or more other orders comprising at least one of the one or more items; and when the order is determined to be eligible for batch picking with the one or more other orders: creating one or more clusters by clustering together (1) the at least one of the one or more items of the order and (2) the at least one of the one or more items of the one or more other orders; estimating, for each respective cluster of the one or more clusters, an estimated fulfillment time interval to make ready the order; and assigning each respective cluster of the one or more clusters to at least one respective picker of one or more respective pickers. Other embodiments are disclosed herein.

Abstract: A number of embodiments can include a system. The system can include one or more processors and one or more non-transitory computer-readable storage devices storing computing instructions. The computing instructions can be configured to run on the one or more processors and perform: receiving a request for a picked order that can comprise: a conveyance type; and one or more goods; estimating a fulfillment time interval to make ready the one or more goods of the picked order by: evaluating whether the picked order is able to be batched in a picked order batch; and when the picked order is able to be batched, evaluating the conveyance type to determine a conveyance type average fulfilment time interval; determining, using the fulfillment time interval, as estimated, and the conveyance type average fulfilment time interval, a receivable clock time at which to promise the one or more goods for receipt by a receiver; and communicating the receivable clock time to an electronic device of the receiver.

Abstract: A number of embodiments can include a system. The system can include one or more processors and one or more non-transitory computer-readable storage devices storing computing instructions.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving a request for an order comprising one or more items; determining when the order is eligible for batch picking by finding one or more other orders comprising at least one of the one or more items; and when the order is determined to be eligible for batch picking with the one or more other orders: creating one or more clusters by clustering together (1) the at least one of the one or more items of the order and (2) the at least one of the one or more items of the one or more other orders; estimating, for each respective cluster of the one or more clusters, an estimated fulfillment time interval to make ready the order; and assigning each respective cluster of the one or more clusters to at least one respective picker of one or more respective pickers. Other embodiments are disclosed herein.

Abstract: A system for rush order fulfilment optimization is discussed. The system includes mobile devices that are each associated with a worker and a rush fulfillment engine executed by a computing system which dynamically updates a task queue of each worker upon receipt of a new rush order according to a task completion rate difference between an estimated task completion rate and the current task completion rate of the worker.

Abstract: A system comprising one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform: receiving a plurality of orders comprising one or more items associated with a plurality of retail stores; separating the plurality of orders by a plurality of load numbers; generating, using an optimization algorithm, a plurality of rebatched orders; sorting the one or more items within the plurality of rebatched orders by sequence numbers; and transmitting the one or more items within the plurality of rebatched orders, as sorted, to a plurality of user devices for filling each respective one of the number of containers with the one or more items within the plurality of rebatched orders. Other embodiments are described.

Abstract: A method including receiving a plurality of orders comprising one or more items, wherein the server computing device is configured to communicate with a plurality of user devices of a plurality of users associated with a plurality of retail stores. The method also can include batching the plurality of orders into different commodities, and generating a plurality of rebatched orders according to an optimization algorithm. The method additionally can include sorting the one or more items within the plurality of rebatched orders by sequence numbers based on at least a respective volume of each respective one of a number of containers. The method further can include transmitting the one or more items within the plurality of rebatched orders to the plurality of user devices for filling the each respective one of the number of containers with the one or more items within the plurality of rebatched orders. Other embodiments are disclosed herein.

Abstract: Methods and systems and computer-readable media are provided for dual optimization of pick walk and tote fill rates in order picking. Embodiments provide improved order picking speed and quality by optimizing pick routing with consideration of both proximity constraints and tote value constraints. Tote value constraints can include constraints on carrying capacity, volume, size in a particular dimension, or weight capacity.

Abstract: Methods and systems and computer-readable media are provided for dual optimization of pick walk and tote fill rates in order picking. Embodiments provide improved order picking speed and quality by optimizing pick routing with consideration of both proximity constraints and tote value constraints. Tote value constraints can include constraints on carrying capacity, volume, size in a particular dimension, or weight capacity.

Abstract: A system for rush order fulfillment optimization is discussed. The system includes mobile devices that are each associated with a worker and a rush fulfillment engine executed by a computing system which dynamically updates a task queue of each worker upon receipt of a new rush order according to a task completion rate difference between an estimated task completion rate and the current task completion rate of the worker.

Abstract: A number of embodiments can include a system. The system can include one or more processors and one or more non-transitory computer-readable storage devices storing computing instructions. The computing instructions can be configured to run on the one or more processors and perform: receiving a request for a picked order that can comprise: a conveyance type; and one or more goods; estimating a fulfillment time interval to make ready the one or more goods of the picked order by: evaluating whether the picked order is able to be batched in a picked order batch; and when the picked order is able to be batched, evaluating the conveyance type to determine a conveyance type average fulfilment time interval; determining, using the fulfillment time interval, as estimated, and the conveyance type average fulfilment time interval, a receivable clock time at which to promise the one or more goods for receipt by a receiver; and communicating the receivable clock time to an electronic device of the receiver.

Abstract: A number of embodiments can include a system. The system can include one or more processors and one or more non-transitory computer-readable storage devices storing computing instructions.

Abstract: A system for rush order fulfillment optimization is discussed. The system includes mobile devices that are each associated with a worker and a rush fulfillment engine executed by a computing system which dynamically updates a task queue of each worker upon receipt of a new rush order according to a task completion rate difference between an estimated task completion rate and the current task completion rate of the worker.

Abstract: A system for rush order fulfilment optimization is discussed. The system includes mobile devices that are each associated with a worker and a rush fulfillment engine executed by a computing system which dynamically updates a task queue of each worker upon receipt of a new rush order according to a task completion rate difference between an estimated task completion rate and the current task completion rate of the worker.

Abstract: Some embodiments include a system. The system can include one or more processors and one or more non-transitory memory storage devices storing computer instructions configured to run on the processor(s) and perform acts including: receiving a request for a picked sales order; estimating an estimated fulfillment time interval to make ready the good(s) of the picked sales order for receipt by the customer, wherein estimating the estimated fulfillment time interval to make ready the good(s) of the picked sales order for receipt by the customer comprises evaluating whether the picked sales order is able to be batched in a picked sales order batch using a k-means clustering to minimize a pick walk of the picked sales order batch; determining a receivable clock time at which to promise the good(s) for receipt by the customer; and communicating the receivable clock time to the customer. Other embodiments of related systems and methods are also provided.