CN115375231A - Storage bit allocation method and device, electronic equipment and computer readable medium - Google Patents
Storage bit allocation method and device, electronic equipment and computer readable medium Download PDFInfo
- Publication number
- CN115375231A CN115375231A CN202211007674.5A CN202211007674A CN115375231A CN 115375231 A CN115375231 A CN 115375231A CN 202211007674 A CN202211007674 A CN 202211007674A CN 115375231 A CN115375231 A CN 115375231A
- Authority
- CN
- China
- Prior art keywords
- storage
- bit
- group
- type
- container
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Economics (AREA)
- Engineering & Computer Science (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Finance (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Accounting & Taxation (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The disclosure provides a storage position allocation method and device, and relates to the technical field of Internet of vehicles. One embodiment of the method comprises: determining a parity type of a container to be put in storage, wherein the parity type is used for representing the type of the container which can be positioned in the same storage level and has at least one specification; detecting whether a stereo library has a storage bit group corresponding to the same position type; in response to detecting that the stereo library has a storage bit group corresponding to the same-position type, detecting whether a free storage bit area exists on the storage bit group; and responding to the detection that the storage bit group has an idle storage bit area, and allocating storage bits for the containers to be warehoused based on the idle storage bit area. This embodiment increases the flexibility of bin allocation.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a storage allocation method and apparatus, an electronic device, and a computer readable medium.
Background
Along with the application of intensive storage project in different trades is more and more, wear solid storehouse intensive storage more and more to the scene of different specification packing box mixed storage, among the conventional art, will store up the position planning design to several kinds of packing box sizes in advance, adopt the mode that the layering was deposited more, the storage flexibility is relatively poor, the later maintenance degree of difficulty is big, and has the storage density low, the extravagant problem of shelf space.
Disclosure of Invention
The embodiment of the disclosure provides a storage bit allocation method and device, an electronic device and a computer readable medium.
In a first aspect, an embodiment of the present disclosure provides a storage bit allocation method, including: determining a parity type of a container to be put in storage, wherein the parity type is used for representing the type of the container which can be positioned in the same storage level and has at least one specification; detecting whether a stereo library has a storage bit group corresponding to the same position type; in response to detecting that the stereo library has a bit storage group corresponding to the same position type, detecting whether a free bit storage area exists on the bit storage group; and responding to the detection that the storage bit group is provided with an idle storage bit area, and distributing storage bits for the containers to be put in storage based on the idle storage bit area.
In some embodiments, the above method further comprises: in response to detecting that the stereo library does not have a bin group corresponding to the co-location type, dividing a plurality of bins on the stereo library into a bin group; binding the same-position type and the storage bit group to make the storage bit group be a storage bit group corresponding to the same-position type; dividing a plurality of bit storage regions on the bit storage group based on the parity type; and allocating storage positions for the containers to be put in storage based on the storage position areas.
In some embodiments, the dividing the bit storage regions into the bit storage groups based on the parity type includes: determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type; determining the number of the storage positions occupied by the storage position area based on the specification of the maximum area; and dividing the storage positions on the storage position group into a plurality of storage position areas based on the number of the storage positions occupied by the storage position areas.
In some embodiments, the dividing the bit storage regions into the bit storage groups based on the parity type includes: determining a plurality of storage area specifications based on the specification of each container corresponding to the same-position type; sorting the specifications of the plurality of storage areas in an ascending order or a descending order to obtain an area specification sequence; and dividing the storage bit groups in sequence according to the specification size of each storage area in the area specification sequence to obtain a plurality of storage bit areas.
In some embodiments, the allocating a bin for the container to be warehoused based on a free bin region in response to detecting that the bin group has the free bin region includes: determining the specification of a container to be warehoused; and selecting the storage position corresponding to the idle storage position area which is larger than or equal to the specification of the container to be warehoused from the idle storage position areas as the storage position distributed to the container to be warehoused.
In some embodiments, the above method further comprises: in response to detecting that no free bit storage area exists on the bit storage group, dividing a plurality of bits on the stereo library into one bit storage group; binding the parity type and the storage bit group to make the storage bit group be a storage bit group corresponding to the parity type; dividing a plurality of bit storage regions on the bit storage group based on the parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
In a second aspect, an embodiment of the present disclosure provides a storage allocation apparatus, including: the storage system comprises a determining unit, a storage unit and a storage unit, wherein the determining unit is configured to determine a parity type of a container to be warehoused, and the parity type is used for representing the type of the container which can be located in the same storage level and has at least one specification; a bin group detection unit configured to detect whether a bin group corresponding to the parity type exists in the stereo library; a region detection unit configured to detect whether there is a free bit storage region on a bit storage group in response to detecting that the stereo library has the bit storage group corresponding to the parity type; and the allocation unit is configured to respond to the detection that the storage bit group has a free storage bit area, and allocate a storage bit for the container to be warehoused based on the free storage bit area.
In some embodiments, the above apparatus further comprises: a bit storage dividing unit configured to divide a plurality of bits on the stereo library into one bit storage group in response to detecting that the stereo library does not have the bit storage group corresponding to the parity type; binding the parity type and the storage bit group to make the storage bit group be a storage bit group corresponding to the parity type; dividing a plurality of bit storage regions on the bit storage group based on the parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
In some embodiments, the bin dividing unit is further configured to: determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type; determining the number of the storage positions occupied by the storage position area based on the specification of the maximum area; and dividing the storage positions on the storage position group into a plurality of storage position areas based on the number of the storage positions occupied by the storage position areas.
In some embodiments, the bin dividing unit is further configured to: determining a plurality of storage area specifications based on the specification of each container corresponding to the same-position type; sequencing the specifications of the plurality of storage areas in an ascending or descending manner to obtain an area specification sequence; and dividing the storage bit groups in sequence according to the specification size of each storage area in the area specification sequence to obtain a plurality of storage bit areas.
In some embodiments, the above-described allocation unit is configured to: determining the specification of a container to be warehoused; and selecting the storage position corresponding to the idle storage position area which is larger than or equal to the specification of the container to be warehoused from the idle storage position areas as the storage position distributed to the container to be warehoused.
In some embodiments, the above apparatus further comprises: a subdivision unit configured to divide a plurality of storage bits on the stereo library into a storage bit group in response to detecting that there is no free storage bit region on the storage bit group; binding the parity type and the storage bit group to make the storage bit group be a storage bit group corresponding to the parity type; dividing a plurality of bit storage regions on the bit storage group based on the parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including: one or more processors; a storage device having one or more programs stored thereon; when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method as described in any implementation of the first aspect.
In a fourth aspect, embodiments of the present disclosure provide a computer-readable medium on which a computer program is stored, which when executed by a processor implements the method as described in any of the implementations of the first aspect.
The storage position allocation method and the storage position allocation device provided by the embodiment of the disclosure are characterized in that firstly, a parity type of a container to be put in storage is determined, and the parity type is used for representing the type of the container which can be positioned at the same storage level and has at least one specification; secondly, detecting whether a storage bit group corresponding to the same-position type exists in the stereo library; thirdly, in response to detecting that the stereo library has a storage bit group corresponding to the same-position type, detecting whether a free storage bit area exists on the storage bit group; and finally, responding to the detection that the storage bit group has an idle storage bit area, and distributing storage bits for the containers to be warehoused based on the idle storage bit area. Therefore, the scheme of the method does not need to distinguish layers, can be arranged on any layer of the three-dimensional warehouse, classifies containers of different specifications which need to be placed on the same layer through the same-position type, and meets the requirements of different box-type containers on the same layer; the storage position group has a plurality of storage position areas, and the aim of flexibly distributing storage positions for the containers to be warehoused can be fulfilled by judging the idle storage position areas.
Drawings
Other features, objects and advantages of the present disclosure will become more apparent upon reading of the detailed description of non-limiting embodiments made with reference to the following drawings:
FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present disclosure may be applied;
FIG. 2 is a flow chart diagram of one embodiment of a bin allocation method according to the present disclosure;
FIG. 3 is a flow chart diagram of another embodiment of a bin allocation method according to the present disclosure;
FIG. 4 is a schematic diagram of an embodiment of the present disclosure for dividing a plurality of bit regions;
FIG. 5 is a schematic structural view of one embodiment of a magazine dispensing apparatus according to the present disclosure;
FIG. 6 is a schematic structural diagram of an electronic device suitable for use in implementing embodiments of the present disclosure.
Detailed Description
The present disclosure is described in further detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not to be construed as limiting the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 illustrates an exemplary system architecture 100 to which the disclosed bin allocation method may be applied.
As shown in fig. 1, the system architecture 100 may include terminals 101, 102, a network 103, a database server 104, and a server 105. The network 103 serves as a medium for providing communication links between the terminals 101, 102, the database server 104 and the server 105. Network 103 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user 110 may use the terminals 101, 102 to interact with the server 105 over the network 103 to receive or send messages or the like. The terminals 101, 102 may have various client applications installed thereon, such as a model training application, an image recognition application, a shopping application, a payment application, a web browser, an instant messenger, and the like.
Here, the terminals 101 and 102 may be hardware or software. When the terminals 101 and 102 are hardware, they may be various electronic devices with display screens, including but not limited to smart phones, tablet computers, e-book readers, MP3 players (Moving Picture Experts Group Audio Layer III), laptop portable computers, desktop computers, and the like. When the terminals 101 and 102 are software, they can be installed in the electronic devices listed above. It may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.
The server 105 may also be a server providing various services, such as a background server providing support for various applications displayed on the terminals 101, 102. The background server may generate storage positions of the containers to be warehoused in different stereoscopic warehouses by using the same-position types of the containers to be warehoused sent by the terminals 101 and 102, and may send the generated storage positions to the terminals 101 and 102. In this way, the user can use the generated storage position to store a plurality of containers in an actual multi-pass stereo library, wherein the multi-pass stereo library is a kind of dense storage device in the warehouse.
Here, the database server 104 and the server 105 may be hardware or software. When they are hardware, they can be implemented as a distributed server cluster composed of a plurality of servers, or as a single server. When they are software, they may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services), or as a single piece of software or software module. And is not particularly limited herein.
It should be noted that the storage allocation method provided by the embodiment of the present disclosure is generally executed by the server 105. Accordingly, the slot allocation apparatus is also typically disposed in the server 105.
It is noted that database server 104 may not be provided in system architecture 100, as server 105 may perform the relevant functions of database server 104.
It should be understood that the number of terminals, networks, database servers, and servers in fig. 1 are merely illustrative. There may be any number of terminals, networks, database servers, and servers, as desired for implementation.
The traditional warehouse layer number distribution and storage mode is fixed, for example: the first layer of the fixed warehouse is used for storing the box type containers A, the 2 nd layer to the 3 rd layer is used for storing the box type containers B, different box types are stored in different layers in a relatively fixed storage mode, the number of layers of the warehouse is strictly required, different box types cannot be mixed in the same layer, the number of the stored containers in each layer is fixed, and storage space is greatly wasted.
The present disclosure also provides a storage allocation method, which removes the concept of fixed storage and proposes dynamic storage management to solve the disadvantages of fixed storage, and referring to fig. 2, a flow 200 of an embodiment of the storage allocation method according to the present disclosure is shown, the storage allocation method includes the following steps:
In this embodiment, a container to be put into storage is a container to be put into a stereoscopic warehouse, and before the container to be put into storage is put into the stereoscopic warehouse, a storage position of the container to be put into storage in the stereoscopic warehouse may be determined by the storage position allocation method of the present disclosure, where the storage position is also a storage position allocated to the container to be put into storage in the stereoscopic warehouse (a storage position is a basic unit of the stereoscopic warehouse, and a storage position allocated to the container to be put into storage may be a plurality of storage positions in the stereoscopic warehouse or may be one storage position of the stereoscopic warehouse).
Alternatively, the stereoscopic warehouse may be a multi-pass stereoscopic warehouse, which is a kind of dense storage device in a warehouse.
In this embodiment, the parity type is used to characterize the types of containers that can be located at the same storage level and have at least one specification; wherein, the specification of container is the physical property of container, and the specification generally includes: volume, length, character, weight, etc. The co-location type may be preset for different containers, and the co-location type of each container may be obtained from a database (the configuration relationship related to the co-location type is initialized in the database in advance) or obtained from a third party (the configuration relationship related to the co-location type is initialized in the third party in advance).
In this embodiment, the parity type is an abstract concept of classifying containers of different box types, and in the case of a very large container size, for example, when the container size reaches dozens of containers, a manufacturer may want to put several containers together as much as possible, so that containers of different sizes are classified according to a certain rule. Alternatively, containers of the same type but different sizes may be of the same co-located type, such as: a1 The A2, A3 … box type belongs to co-located type A, B1, B2, B3 … box type belongs to co-located type B, C1, C2, C3 … box type belongs to co-located type C, and so on. Containers of the same parity type may be stored in a set of storage bits.
Alternatively, the co-located types of different containers may be pre-configured by the execution body based on the dispensing requirements.
In this embodiment, the bit storage group is a bit storage set composed of a plurality of bits, each bit is a basic unit of a stereo library, the stereo library has multiple layers, each layer has a plurality of bits, at least one bit is divided into the bit storage group, and the bit storage group can store containers belonging to the same parity type but having different specifications.
In this embodiment, before allocating storage bits to a container to be put in storage, a plurality of storage bit groups in the stereo library may be determined, each storage bit group is bound to a parity type, and after the parity type is obtained, a storage bit group corresponding to the parity type is determined by the binding relationship.
In this embodiment, the bit storage group includes at least one bit, and the bit storage region is a region on the bit storage group, generally, the bit storage region is a subgroup of the bit storage group, the bit storage region may be the whole bit storage group, or may be a part of the bit storage group, that is, the bit storage region includes at least one bit.
In this embodiment, the bit storage group includes at least one bit storage region, and after a binding relationship is established between each bit storage region in the at least one bit storage region and the container (the bit storage region is occupied by the container), it is determined that there is no idle bit storage region on the bit storage group; and when any one or more bit regions in the at least one bit region do not establish a binding relationship with the container (are not occupied by the container), determining that the bit regions with free positions exist on the bit groups.
And 204, responding to the detection that the storage bit group has an idle storage bit area, and allocating storage bits for the containers to be warehoused based on the idle storage bit area.
In this embodiment, when the storage group has an idle storage location area, an association relationship is established between the container to be put into storage and the idle storage location area, so that a storage location corresponding to the idle storage location area is allocated to the container to be put into storage.
The storage position allocation method provided by the embodiment of the disclosure realizes mixed storage of multiple box types, improves the space utilization rate, and reduces the influence of the box type on the layer number.
The storage position allocation method provided by the embodiment of the disclosure comprises the steps of firstly, determining a co-located type of a container to be put in storage, wherein the co-located type is used for representing the type of the container which can be positioned at the same storage level and has at least one specification; secondly, detecting whether a storage bit group corresponding to the same-position type exists in the stereo library or not; thirdly, in response to detecting that the stereo library has a storage bit group corresponding to the same-position type, detecting whether a free storage bit area exists on the storage bit group; and finally, responding to the detection that the storage bit group has an idle storage bit area, and distributing storage bits for the containers to be warehoused based on the idle storage bit area. Therefore, the scheme of the method does not need to distinguish the layers of the three-dimensional warehouse, any layer of the three-dimensional warehouse can be produced, containers of different specifications needing to be placed on the same layer are classified through the same-position type, and the requirement of different box types on the same layer in a mixed mode is met; the storage position group has a plurality of storage position areas, and the aim of flexibly distributing storage positions for the containers to be warehoused can be fulfilled by judging the idle storage position areas.
In order to better plan the space of the stereoscopic warehouse, optionally, in another embodiment of the storage allocation method of the present disclosure, before determining the co-located type of the container to be warehoused, the storage allocation method further includes: determining the distribution of storage positions of each layer of the three-dimensional library; dividing each layer of storage bit into at least one storage bit group based on the distribution of each layer of storage bit; binding each bit group with different parity types, and dividing each bit group into a plurality of different bit regions.
The dividing of each bin group into a plurality of different bin regions comprises: for each storage bit group, determining the specification of a container corresponding to the same-position type based on the same-position type corresponding to the storage bit group; based on the specification of the container, a plurality of bins in the set of bins are marked such that bin regions are created between adjacent marked bins.
In another embodiment of the storage bit allocation method disclosed in the present disclosure, when the stereo library does not have a storage bit group corresponding to a same-position type, the storage bit group may be further planned, and a storage bit region is divided on the planned storage bit ancestor, so as to improve reliability of dynamically allocating the storage bit region, as shown in fig. 3, a flow 300 according to another embodiment of the storage bit allocation method disclosed in the present disclosure is shown, and the storage bit allocation method includes the following steps:
And step 305, ending.
It should be understood that the operations and features in steps 301 to 304 correspond to those in steps 101 to 104, respectively, and therefore the description of the operations and features in steps 101 to 104 applies to steps 301 to 304, which is not described herein again.
In this embodiment, when no idle bit storage area is detected in the bit storage group, the bit storage group needs to be determined in the stereo library, and the bit storage area needs to be divided on the new bit storage group, so that the container to be put into storage may have an allocation position on the idle bit storage area of the new bit storage group.
In this embodiment, when the stereo library does not have the bit group corresponding to the parity type of the container to be warehoused, a new bit group corresponding to the parity type needs to be bound in the stereo library, and a bit area is divided on the new bit group, so that the container to be warehoused can have an allocation position on the free bit area of the new bit group.
In this embodiment, binding the parity type and the storage bit group means storing a corresponding relationship between the parity type and the storage bit group to obtain a corresponding relationship table of the parity type and the storage bit group, and before binding the parity type and the storage bit group, first binding the storage bit group and each storage bit in the storage bit group, that is, the corresponding relationship between each storage bit in the storage bit group and the storage bit group, to obtain a corresponding relationship table of the storage bit and the storage bit group. For example, as shown in fig. 4, the storage position between any two adjacent columns in the stereo library is used as a storage position group, a corresponding relationship between the storage position between the two adjacent columns and the storage position group01 is established, and then a corresponding relationship between the storage position group01 and the co-located type a is established.
In this embodiment, the storage location groups may be divided into storage location areas based on specifications of a plurality of containers corresponding to the current parity type, for example, in fig. 4, the parity type a corresponds to a storage location group01, two storage location areas are divided on the storage location group01, the number of storage locations occupied by each storage location area in the two storage location areas is different, and the first container A1 'and the second container A2' are respectively and correspondingly placed in the two storage location areas; the same-position type B corresponds to a storage position group02, the storage position group02 is divided into three storage position areas, the number of the storage positions occupied by each storage position area in the three storage position areas is different, and the three storage position areas are respectively and correspondingly provided with a third container B1', a fourth container B2' and a fifth container B3'.
In practical application, the storage bit is a basic unit of the three-dimensional library, the storage bit group has at least one storage bit, and the storage bit area can be represented as storage bits with different bits in the opened storage bit group. Specifically, before the bank is not opened, the fields of all the storage bits in the bank are all 0, indicating that each storage bit is opened. When the container occupies the bit group (for example, occupies 10 bits), i.e. the bit group is opened, the bits of the bit group will be partially opened according to the container parity type bound by the bit group, such as: when the storage bit group stores the container with the same bit type C, 6 storage bits of 1,3,5,7,9, 10 of the storage bit group are opened, and the field of the storage bit group is 1, so that 6 storage bit areas are opened on the data plane, and the 6 storage bit areas actually occupy the physical positions of the 10 storage bits of the stereo library.
If the storage bit group needs to store a larger container, such as a container with the binding parity type D, the 1,4,7 of the storage bit group (e.g. occupying 10 storage bits) has 3 storage bits opened, and the field of the storage bit group is set to 1. That is, 3 bay areas are open at the data plane, the 3 bay areas actually occupying the physical locations of the 10 bays, each open bay being capable of separating into a larger physical location, enabling the storage of a larger container. The division mode of the storage area can be configured in advance based on the storage requirement of the container.
In this embodiment, after the plurality of storage location areas are divided, the storage locations occupied by the storage location areas may be matched with the specification of the container to be warehoused, and the storage location area meeting the specification of the container to be warehoused in the storage location area is selected as the storage location to be stored in the container to be warehoused.
According to the storage allocation method provided by the embodiment, when it is detected that the stereo library does not have a storage group corresponding to the same position type of the container to be put in storage, or when it is detected that no idle storage region exists on the storage group, the storage group is divided based on the storage position on the stereo library, the same position type and the storage group are bound, a plurality of storage regions are divided on the storage group, and the storage position is allocated to the container to be put in storage based on the storage region, so that the purpose of adapting to storage of containers of different specifications is achieved by dynamically changing the storage position corresponding to the storage region in the storage group and adjusting the containers which can be stored by the storage group, and a reliable basis is provided for dynamically adjusting the storage allocation of containers of different specifications.
In some optional embodiments of the disclosure, the dividing the plurality of bit regions over the set of bit banks based on the parity type includes: determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type; determining the number of the storage positions occupied by the storage position area based on the specification of the maximum area; and dividing the storage positions on the storage position group into a plurality of storage position areas based on the number of the storage positions occupied by the storage position areas.
In this optional implementation manner, when the parity type is determined, the specifications of all containers corresponding to the parity type may be determined, the container with the largest specification among all containers corresponding to the parity type is selected, and the specification of the container is used as the specification of the largest area.
In this optional implementation manner, the storage position corresponding to the specification of the maximum region is used as a unit for dividing the storage position region, so as to obtain a plurality of storage position regions on the storage position group. For example, the set of bins includes: 12 storage positions, the specification of the maximum area is 3 storage positions, and the total number of the storage position areas divided on the storage positions is 4.
The method for dividing the plurality of storage bit regions provided by the optional implementation mode averagely divides the storage bit groups on the basis of the specification of the maximum region, and ensures that all containers corresponding to the same-position type can be stored on the storage bit groups.
Optionally, the dividing the bit storage regions into the bit storage groups based on the parity type includes: determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type; and dividing a plurality of storage bit regions of all storage bits on the storage bit group by taking the specification of the maximum region as a unit, wherein all equal regions on the storage bit region storage bit group are divided storage bit regions.
In some optional embodiments of the disclosure, the dividing the plurality of bit regions over the set of bit banks based on the parity type includes: determining a plurality of storage area specifications based on the specification of each container corresponding to the same-position type; sorting the specifications of the plurality of storage areas in an ascending order or a descending order to obtain an area specification sequence; and dividing the storage bit groups in sequence according to the specification size of each storage area in the area specification sequence to obtain a plurality of storage bit areas.
As shown in fig. 4, the stereo library has three layers, and the storage space between the pillars of each layer of the stereo library is divided into storage space groups, for example: the storage positions 01-10 between No. 1-No. 2 upright posts of the first layer are divided into storage group groups 01, and the storage positions 11-20 between No. 2-No. 3 upright posts are divided into storage group groups 02; the storage positions 01-10 between No. 1-No. 2 upright columns of the second layer are divided into storage group groups 03, and the storage positions 11-20 between No. 2-No. 3 upright columns are divided into storage group groups 04.
Before a container to be warehoused does not enter the storage bit group, the storage bit group and the storage bits in the storage bit group are both in a closed state on a data layer, when a container with the parity type A is warehoused, the storage bit group01 is firstly opened and the parity type A of the container is bound, and according to the parity type of the container, the storage bits in the storage bit group01 are determined to be opened on the data layer, for example: the 01, 05 and 09 storage positions are opened on the data layer, the areas among the storage positions are storage position areas, so that the storage position group01 is divided into 3 storage position areas at present, the 3 storage position areas actually occupy the physical positions of 10 storage positions, and 1 container can occupy the physical positions of 3 storage positions on average.
In this embodiment, when a larger container is required to be stored, such as: when a container with the same-position type B is put in storage, firstly opening the storage group02 and binding the same-position type B of the container, and opening 01 and 06 storage positions in the storage group02, so that the storage group02 is currently divided into 2 storage position areas, the 2 storage position areas actually occupy 10 physical positions of the storage positions, and 1 container can occupy 5 physical positions on average, compared with the storage group01, the storage group02 can store containers with larger specifications.
According to the above example, the total physical size of the storage position group is 10 storage positions, and the number of the containers which can be stored in the storage position group is adjusted by changing the number of the storage position areas in the storage position group, so that the purpose of being suitable for storing containers of different specifications is achieved.
The dynamic storage position design scheme does not need to distinguish layers of the stereo library, can arrange production to any layer of the stereo library, then arrange production to the storage position group, and finally arrange production to the storage position of the storage position group through the storage position area divided on the storage position group.
In this embodiment, the number of the storage bits occupied by the storage bit regions divided on the storage bit group may be the same or different. The maximum number of the storage positions occupied by the storage position areas exceeds the containers occupying the most storage positions in the same position type, and the minimum number of the storage positions occupied by the storage position areas is larger than the containers occupying the least storage positions in the same position type.
In the optional implementation mode, the storage area specifications are sorted, so that the specifications of different storage area regions can be effectively distinguished, and a solid foundation is laid for the storage area division of all containers in the current same-position type.
The method for dividing the plurality of storage area provided by the optional implementation mode determines the specifications of the plurality of storage areas based on the specification of each container of the same-position type, obtains the plurality of storage areas according to the area specification sequence corresponding to the storage area specification, enables the storage container of each specification to have the corresponding storage area on the storage bit group, improves the flexibility of division of the storage bit group area, and ensures that all the containers corresponding to the same-position type can be dynamically and effectively stored on the storage bit group.
In some optional embodiments of the disclosure, the allocating a storage location for the container to be warehoused based on a free storage location area in response to detecting that there is a free storage location area on the storage location group includes: determining the specification of a container to be warehoused; and selecting the storage position corresponding to the idle storage position area which is larger than or equal to the specification of the container to be warehoused from the idle storage position areas as the storage position distributed to the container to be warehoused.
In this optional implementation manner, the specification of the container to be warehoused reflects the size of the space occupied by the container to be warehoused in the three-dimensional warehouse, the storage location area corresponding to the container to be warehoused is determined according to the specification of the container to be warehoused, and the storage location corresponding to the storage location area of the container to be warehoused is used as the storage location for distributing the container to be warehoused.
According to the method for allocating the storage positions to the containers to be warehoused, the idle storage position area which is larger than or equal to the specification of the container to be warehoused is selected from the idle storage position areas and used as the storage position of the container to be warehoused, so that the container to be warehoused can be effectively stored in the storage position group, and the reliability of the storage position group of the container to be warehoused is improved.
Optionally, the above allocating a storage location for a container to be warehoused based on an idle storage location area in response to detecting that the storage location group has the idle storage location area includes: determining the specification of a container to be warehoused; and selecting a storage position corresponding to the idle storage position area which is completely matched with the specification of the container to be warehoused from the idle storage position areas as a storage position distributed to the container to be warehoused.
In the optional implementation mode, the storage position groups can be divided into storage position areas which are completely matched with the specification of the container to be warehoused, when the container to be warehoused needs to be stored in the three-dimensional warehouse, the storage position areas which are completely matched with the container to be warehoused are selected, the space of the three-dimensional warehouse can be effectively utilized, and the storage position groups which are not initialized in advance and are not fixed can be arranged to any layer of the three-dimensional warehouse according to the type of the container and then arranged to any storage position.
In another embodiment of the present disclosure, the method further includes: in response to detecting that no free bit storage area exists on the bit storage group, dividing a plurality of bits on the stereo library into one bit storage group; binding the parity type and the storage bit group to make the storage bit group be a storage bit group corresponding to the parity type; partitioning a plurality of bin regions on a bin group based on a parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
According to the storage bit allocation method provided by the optional implementation mode, when the current storage bit group has no idle storage bit region, the storage bit group is bound again through the same position type of the container to be warehoused, and the storage bit region on the storage bit group is divided again, so that the storage position can be quickly and conveniently provided for the container to be warehoused. After the storage bit group is bound again, the storage bit group is bound with the container parity type, and the storage bit group is specified to be only stored in the container of the parity type after being bound.
In this optional implementation manner, the dividing the plurality of bit storage regions on the bit storage group based on the parity type includes: determining all container specifications corresponding to the same-position type based on the same-position type; based on the specification of all containers, marking storage positions on a storage position group with region marks, enabling a region between two storage positions of two marks which are adjacent in sequence to be a storage position region, when the storage position region of the storage position group is occupied by a container (the storage position region and the container establish a corresponding relation), enabling the storage position region to be in a non-idle state, and setting the state of the storage position region to be 1 (1 or 0 of the state, which can be set according to requirements); when the bit storage area of the bit storage group is not occupied by a container (the bit storage area and the container do not establish a corresponding relationship), the bit storage area handles an idle state, and the state of the bit storage area can be set to 0.
According to the storage bit allocation method provided by the embodiment, when no idle storage bit region exists on the storage bit group, the storage bit group is divided based on the storage bits on the stereo library, the same-position type and the storage bit group are bound, a plurality of storage bit regions are divided on the storage bit group, and the storage bits are allocated for the containers to be put in storage based on the storage bit regions, so that the containers which can be stored by the storage bit group are adjusted by dynamically changing the storage bits corresponding to the storage regions in the storage bit group, the purpose of adapting to the storage of the containers with different specifications is achieved, and a reliable basis is provided for dynamically adjusting the storage bit allocation of the containers with different specifications.
With further reference to fig. 5, as an implementation of the methods shown in the above-mentioned figures, the present disclosure provides an embodiment of a storage allocation apparatus, which corresponds to the embodiment of the method shown in fig. 2, and which can be applied in various electronic devices.
As shown in fig. 5, an embodiment of the present disclosure provides a storage allocation apparatus 500, the apparatus 500 including: a determination unit 501, a storage bit group detection unit 502, an area detection unit 503, and an allocation unit 504. The determining unit 501 may be configured to determine a parity type of the container to be warehoused, where the parity type is used to represent a type of the container that may be located in the same storage hierarchy and has at least one specification. The bin group detecting unit 502 may be configured to detect whether the stereo library has a bin group corresponding to the parity type. The region detecting unit 503 may be configured to detect whether there is a free bit region on the bit group in response to detecting that the stereo library has the bit group corresponding to the parity type. The allocating unit 504 may be configured to, in response to detecting that there is a free storage location area on the storage location group, allocate a storage location for the container to be warehoused based on the free storage location area.
In the present embodiment, in the storage allocation apparatus 500, the specific processes of the determining unit 501, the storage group detecting unit 502, the region detecting unit 503 and the allocating unit 504 and the technical effects thereof can refer to step 201, step 202, step 203 and step 204 in the corresponding embodiment of fig. 2, respectively.
In some embodiments, the above-mentioned storage allocation apparatus 500 further comprises: a bit dividing unit (not shown), which may be configured to: in response to detecting that the stereo library does not have a storage bit group corresponding to the co-location type, dividing a plurality of storage bits on the stereo library into a storage bit group; binding the same-position type and the storage bit group to make the storage bit group be a storage bit group corresponding to the same-position type; dividing a plurality of bit storage regions on the bit storage group based on the parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
In some embodiments, the bit dividing unit is further configured to: determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type; determining the number of the storage positions occupied by the storage position area based on the specification of the maximum area; and dividing the storage positions on the storage position group into a plurality of storage position areas based on the number of the storage positions occupied by the storage position areas.
In some embodiments, the bin dividing unit is further configured to: determining a plurality of storage area specifications based on the specification of each container corresponding to the same-position type; sorting the specifications of the plurality of storage areas in an ascending order or a descending order to obtain an area specification sequence; and dividing the storage bit groups in sequence according to the specification size of each storage area in the area specification sequence to obtain a plurality of storage bit areas.
In some embodiments, the assigning unit 504 is configured to: determining the specification of a container to be warehoused; and selecting a storage position corresponding to the idle storage position area which is larger than or equal to the specification of the container to be warehoused in the idle storage position area as a storage position distributed to the container to be warehoused.
In some embodiments, the above-mentioned storage allocation apparatus 500 further comprises: the cells are subdivided (not shown). The subdivision unit may be configured to divide the plurality of storage bits in the stereo library into one storage bit group in response to detecting that there is no free storage bit region on the storage bit group; binding the parity type and the storage bit group to make the storage bit group be a storage bit group corresponding to the parity type; partitioning a plurality of bin regions on a bin group based on a parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
First, the determining unit 501 determines a parity type of a container to be put in storage, where the parity type is used to represent types of containers that may be located in the same storage hierarchy and have at least one specification; next, the bit group detection unit 502 detects whether a stereo library has a bit group corresponding to the same bit type; thirdly, the region detection unit 503 detects whether there is a free region of the storage bit on the storage bit group in response to detecting that the stereo library has the storage bit group corresponding to the co-located type; finally, the allocating unit 504 allocates a storage location for the container to be warehoused based on the idle storage location area in response to detecting that the storage location group has the idle storage location area. Therefore, the scheme of the method does not need to distinguish the layers of the three-dimensional warehouse, any layer of the three-dimensional warehouse can be produced, containers of different specifications needing to be placed on the same layer are classified through the same-position type, and the requirement of different box types on the same layer in a mixed mode is met; the storage position group has a plurality of storage position areas, and the aim of flexibly distributing storage positions for the containers to be warehoused can be fulfilled by judging the idle storage position areas.
Referring now to FIG. 6, shown is a schematic diagram of an electronic device 600 suitable for use in implementing embodiments of the present disclosure.
As shown in fig. 6, the electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: an input device 606 including, for example, a touch screen, touch pad, keyboard, mouse, etc.; an output device 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 6 may represent one device or may represent multiple devices as desired.
In particular, the processes described above with reference to the flow diagrams may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 609, or may be installed from the storage means 608, or may be installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of embodiments of the present disclosure.
It should be noted that the computer readable medium of the embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In embodiments of the present disclosure, however, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the server; or may exist separately and not be assembled into the server. The computer readable medium carries one or more programs which, when executed by the server, cause the server to: determining a parity type of a container to be put in storage, wherein the parity type is used for representing the type of the container which can be positioned in the same storage level and has at least one specification; detecting whether a storage bit group corresponding to the same-position type exists in the stereo library; in response to detecting that the stereo library has a storage bit group corresponding to the same-position type, detecting whether a free storage bit area exists on the storage bit group; and responding to the detection that the storage bit group has an idle storage bit area, and allocating storage bits for the containers to be warehoused based on the idle storage bit area.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor comprises a determining unit, a storage bit group detecting unit, an area detecting unit and an allocating unit. Where the names of these units do not in some cases constitute a limitation to the unit itself, for example, the determining unit may also be described as a unit configured to determine a parity type of containers to be warehoused, the parity type being used to characterize the types of containers that may be located at the same storage hierarchy and have at least one specification.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.
Claims (11)
1. A method of reservoir allocation, the method comprising:
determining a parity type of a container to be warehoused, wherein the parity type is used for representing the type of the container which can be positioned in the same storage level and has at least one specification;
detecting whether a stereo library has a storage bit group corresponding to the same position type;
in response to detecting that the stereo library has a storage bit group corresponding to the co-location type, detecting whether a free storage bit region exists on the storage bit group;
and responding to the detection that the storage bit group is provided with the idle storage bit area, and distributing storage bits for the container to be warehoused based on the idle storage bit area.
2. The method of claim 1, further comprising:
in response to detecting that the stereo library does not have a bin group corresponding to the co-located type, dividing a plurality of bins on the stereo library into a bin group;
binding the parity type and the storage bit group to enable the storage bit group to be a storage bit group corresponding to the parity type;
partitioning a plurality of bin regions on the bin group based on the parity type;
and distributing storage positions for the containers to be warehoused based on the storage position areas.
3. The method of claim 2, wherein said partitioning a plurality of bin regions over the bin group based on the parity type comprises:
determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type;
determining the number of the storage positions occupied by the storage position area based on the specification of the maximum area;
and dividing the storage positions on the storage position group into a plurality of storage position areas based on the number of the storage positions occupied by the storage position areas.
4. The method of claim 2, wherein said partitioning a plurality of bin regions over the bin groups based on the parity type comprises:
determining a plurality of storage area specifications based on the specification of each container corresponding to the same-position type;
sorting the multiple storage region specifications in an ascending order or a descending order to obtain a region specification sequence;
and sequentially dividing the storage bit groups according to the specification size of each storage region in the region specification sequence to obtain a plurality of storage bit regions.
5. The method according to one of claims 1 to 4, wherein said allocating a bin for the container to be binned based on the free bin region in response to detecting that the free bin region is on the bin group comprises:
determining the specification of the container to be warehoused;
and selecting a storage position corresponding to the idle storage position area which is larger than or equal to the specification of the container to be warehoused from the idle storage position areas as a storage position allocated to the container to be warehoused.
6. The method according to one of claims 1-4, the method further comprising:
in response to detecting that there is no free bin region on the bin group, dividing a plurality of bins on the stereo library into a bin group;
binding the same-position type and the storage bit group to enable the storage bit group to be a storage bit group corresponding to the same-position type;
partitioning a plurality of bin regions on the bin group based on the parity type;
and distributing storage positions for the containers to be warehoused based on the storage position areas.
7. A bin allocation apparatus, the apparatus comprising:
the storage system comprises a determining unit, a storage unit and a storage unit, wherein the determining unit is configured to determine a parity type of a container to be warehoused, and the parity type is used for representing the type of the container which can be located in the same storage level and has at least one specification;
a bin group detection unit configured to detect whether a stereo library has a bin group corresponding to the parity type;
a region detection unit configured to detect whether there is a free bit storage region on the bit storage group in response to detecting that the stereo library has the bit storage group corresponding to the parity type;
an allocation unit configured to, in response to detecting that there is the free storage location area on the storage location group, allocate a storage location for the container to be warehoused based on the free storage location area.
8. The apparatus of claim 7, further comprising:
a bin dividing unit configured to divide a plurality of bins on the stereo library into a bin group in response to detecting that the stereo library does not have the bin group corresponding to the parity type; binding the parity type and the storage bit group to enable the storage bit group to be a storage bit group corresponding to the parity type; partitioning a plurality of bin regions on the bin group based on the parity type; and distributing storage positions for the containers to be warehoused based on the storage position areas.
9. The apparatus of claim 8, wherein the bin partition unit is further configured to: determining the specification of the maximum area based on the specifications of all containers corresponding to the same-position type; determining the number of the storage positions occupied by the storage position area based on the specification of the maximum area; and dividing the storage positions on the storage position group into a plurality of storage position areas based on the number of the storage positions occupied by the storage position areas.
10. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
11. A computer-readable medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211007674.5A CN115375231A (en) | 2022-08-22 | 2022-08-22 | Storage bit allocation method and device, electronic equipment and computer readable medium |
| PCT/CN2023/095679 WO2024041056A1 (en) | 2022-08-22 | 2023-05-23 | Storage location allocation method and apparatus, electronic device and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211007674.5A CN115375231A (en) | 2022-08-22 | 2022-08-22 | Storage bit allocation method and device, electronic equipment and computer readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115375231A true CN115375231A (en) | 2022-11-22 |
Family
ID=84067748
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211007674.5A Pending CN115375231A (en) | 2022-08-22 | 2022-08-22 | Storage bit allocation method and device, electronic equipment and computer readable medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115375231A (en) |
| WO (1) | WO2024041056A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024041056A1 (en) * | 2022-08-22 | 2024-02-29 | 北京京东乾石科技有限公司 | Storage location allocation method and apparatus, electronic device and computer readable medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4076821B2 (en) * | 2002-08-20 | 2008-04-16 | 村田機械株式会社 | Receipt and shipment management system |
| US9378482B1 (en) * | 2015-03-13 | 2016-06-28 | Amazon Technologies, Inc. | Exchange of containers |
| CN113361985B (en) * | 2020-03-03 | 2024-03-12 | 兰剑智能科技股份有限公司 | Goods space dynamic allocation method and device and electronic equipment |
| CN114564546A (en) * | 2022-01-24 | 2022-05-31 | 北京旷视机器人技术有限公司 | Storage method, equipment, medium and product for material box |
| CN115375231A (en) * | 2022-08-22 | 2022-11-22 | 北京京东乾石科技有限公司 | Storage bit allocation method and device, electronic equipment and computer readable medium |
-
2022
- 2022-08-22 CN CN202211007674.5A patent/CN115375231A/en active Pending
-
2023
- 2023-05-23 WO PCT/CN2023/095679 patent/WO2024041056A1/en unknown
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024041056A1 (en) * | 2022-08-22 | 2024-02-29 | 北京京东乾石科技有限公司 | Storage location allocation method and apparatus, electronic device and computer readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2024041056A1 (en) | 2024-02-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106056529B (en) | Method and equipment for training convolutional neural network for picture recognition | |
| US20120209943A1 (en) | Apparatus and method for controlling distributed memory cluster | |
| CN105550345B (en) | File operation method and device | |
| CN108960708A (en) | Cargo restocking method, apparatus, system, cargo restocking terminal and storage medium | |
| CN109582234A (en) | Storage resources distribution method, device, electronic equipment and computer-readable medium | |
| CN110232537A (en) | Distribute method, apparatus, equipment and the storage medium of data object | |
| CN110413201A (en) | For managing the method, equipment and computer program product of storage system | |
| CN110348679A (en) | Logistics processing method and device, electronic equipment and storage medium | |
| CN110908697A (en) | Resource packaging method, device, server and storage medium | |
| CN109639598A (en) | Request processing method, server, storage medium and device based on micro services | |
| CN111932163A (en) | Method and device for warehouse-out positioning of multi-depth warehouse | |
| CN109286579A (en) | A kind of distribution method of user resources, device and computer readable storage medium | |
| CN106547870A (en) | Point table method and device of data base | |
| CN107944697B (en) | Supply and demand relationship-based heat map calculation method and system, server and medium | |
| CN115375231A (en) | Storage bit allocation method and device, electronic equipment and computer readable medium | |
| CN109345166A (en) | Method and apparatus for generating information | |
| US20170052819A1 (en) | Managing asset placement with respect to a shared pool of configurable computing resources | |
| US10887163B2 (en) | Dynamic planning and configuration based on inconsistent supply | |
| CN109165723A (en) | Method and apparatus for handling data | |
| US9311146B2 (en) | Strategic placement of jobs for spatial elasticity in a high-performance computing environment | |
| CN110834858A (en) | Method and device for storing goods in warehouse | |
| CN113919734A (en) | Order distribution method and device | |
| CN115099865A (en) | Data processing method and device | |
| CN109271438A (en) | A kind of data bank access method and its system | |
| CN116841720A (en) | Resource allocation method, apparatus, computer device, storage medium and program product |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |