Lineage Logistics, LLC

This specification generally discloses a computer-implemented method for re-routing items in a warehouse, comprising designating a first storage location in the warehouse as a destination storage location for an item; sending first instructions to a mechanical conveying system to automatically move the item from a first current position to the first storage location using the mechanical conveying system; determining, while the item is being moved to the first storage location by the mechanical conveying system, that a state of items being moved by the mechanical conveying system satisfies a criterion to change the destination storage location for the item from the first storage location to a second storage location; and sending second instructions to the mechanical conveying system to automatically move the item from a second current position of the item to the second storage location using the mechanical conveying system.

In general, the subject matter described in this disclosure can be embodied in an intake conveying system for a storage facility. The intake conveying system includes a first inbound conveying lane to convey pallets from a first receiving station to a first providing station of the first inbound conveying lane, and a second inbound conveying lane to convey pallets from a second receiving station to a second providing station of the second inbound conveying lane. The intake conveying system also includes a common rework station to receive pallets that do not satisfy criteria for proceeding past the intake conveying system, from both of a first rework conveying lane and a second rework conveying lane. The intake conveying system also includes a first return lane that to receive pallets from the common rework station and provide such pallets to the first inbound conveying lane.

Methods and systems for determining a pallet build sequence include receiving a pick order request, identifying candidate pick items in a warehouse to fulfill the request, grouping the items based on aisles and generating aisle-based lists per group, and sorting each list based on location of each of the items per group from front to back of the warehouse. For each list, the method includes selecting a first item at a top of the list, adding the first item to a bottom layer of a pallet, determining an amount of weight of items from the list that can be layered on top of the first item and determining whether the first item can support the determined amount of weight. If the first item can support the determined weight, the first item can be kept in a pick sequence as the pallet's bottom layer and removed from the list.

Described herein are systems and methods for storing items in storage facilities. The method can include receiving, by a computing system, a request to identify a destination location for a storage item, identifying a set of available storage locations from among a plurality of storage locations, and determining a score for each respective storage location of the set of available storage locations based on multiple sub-scores specific to the respective storage location, to generate a set of scores corresponding to the set of available storage locations. The method also includes selecting a selected storage location from among the available storage locations based on the selected storage location having a most favorable score from among the set of scores corresponding to the set of available storage locations, and providing instructions to cause a mechanical moving system to route the storage item to the selected storage location.

Described herein are systems and methods for ordering item-movement tasks in storage facilities. Item-movement tasks are distributed amongst queues of operators in a first state of the queues. A first value indicating utilization based on the operators performing the queues in the first state is determined. A first task from a first queue is swapped with a second task from a second queue, forming a second state of the queues, such that the first queue to be performed by a first operator includes the second task and the second queue to be performed by a second operator includes the first task. A second value indicating utilization based on the operators performing the queues having the second state is determined. Based on determining that utilization is greater when the queues have the first state, the first task is swapped with the second task to revert the queues to the first state.

This specification generally discloses technology for optimizing the loading of pallets on trucks and other sorts of vehicles. A pallet loading technique includes receiving pallet information for a shipment, the pallet information describing pallets to be included in the shipment, receiving vehicle constraint information for a vehicle, the vehicle constraint information describing rules for loading pallets on the vehicle, and determining candidate solutions for loading the pallets on the vehicle, each candidate solution (i) satisfying the rules for loading pallets on the vehicle, and (ii) defining, for each pallet to be included in the shipment, a respective position and orientation of the pallet on the vehicle. At least some of the candidate solutions are evaluated, one of the candidate solutions is selected, and the vehicle is loaded according to the selected candidate solution.

A computer-based technology is provided to optimize a warehouse space, such as warehouse racks. The technology determines a storage duration of a pallet in a warehouse, and further determines an optimal storage location for the pallet in the warehouse. For example, the technology can determine how long an inbound pallet will stay in a warehouse, and locate an optimal area of the warehouse to store the pallet. Such an optimal pallet storage area is selected to reduce labor costs in transporting the pallet in, within, and out of the warehouse and further optimize the management of multiple pallets in the warehouse as a whole. In addition, the technology can consider the size of the pallet in determining the optimal storage location in the warehouse.

Disclosed are techniques for in-memory resource assignment. A method can include: receiving resource data for first resources and operational environment data having current and scheduled occupancy information for second resources, generating a set of permutations of first resource-to-second resource assignments, while generating the set of permutations: determining whether each assignment of each permutation satisfies assignment conditions, based on determining the assignment does not satisfy the conditions, pruning a subtree of permutations stemming from the permutation to remove them from the set, locally caching information about the assignment that does not satisfy the conditions, for each permutation remaining in the set, determining a permutation score, locally caching a permutation remaining in the set having a highest score to reduce storage and lookup time, selecting the locally-cached permutation, and generating and executing electronic instructions to automatically allocate a first resource with a second resource of the selected permutation.

In general, the subject matter described in this disclosure can be embodied in a multi-level pallet-conveying system for a storage facility. The conveying system includes a first-level conveying system, a first-level into-storage conveying lane adapted to receive pallets from the first-level conveying system and provide such pallets to a first-level station of a storage lifting system, and a first-level from-storage conveying lane adapted to receive pallets from the first-level station of the storage lifting system and provide such pallets to the first-level conveying system. The conveying system also includes a second-level conveying system, a second-level into-storage conveying lane adapted to receive pallets from the second-level conveying system and provide such pallets to a second-level station of the storage lifting system, and a second-level from-storage conveying lane adapted to receive pallets from the second-level station of the storage lifting system and provide such pallets to the second-level conveying system.

Disclosed herein are techniques for computationally efficient scoring and prioritization of resources. A method can include receiving a data request for a resource assignment in an operational environment, retrieving a queue of candidate resources associated with the operational environment, generating a dynamic score for at least one candidate resource in the queue of candidate resources based at least in part on the received data request, updating a prioritized resource list based on the dynamic score for the at least one candidate resource, the prioritized resource list including a group of resources having respective dynamic scores, assigning a resource from the prioritized resource list that satisfies one or more assignment criteria based on the received data request, and returning instructions that cause the assigned resource to be executed.