CN111652408A - Order processing method, device, medium, electronic equipment and system in warehouse - Google Patents

Order processing method, device, medium, electronic equipment and system in warehouse Download PDF

Info

Publication number
CN111652408A
CN111652408A CN202010286123.1A CN202010286123A CN111652408A CN 111652408 A CN111652408 A CN 111652408A CN 202010286123 A CN202010286123 A CN 202010286123A CN 111652408 A CN111652408 A CN 111652408A
Authority
CN
China
Prior art keywords
target
order
station
commodity
busyness
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
Application number
CN202010286123.1A
Other languages
Chinese (zh)
Inventor
吴航
李佳骏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Kuangshi Robot Technology Co Ltd
Original Assignee
Beijing Kuangshi Robot Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Kuangshi Robot Technology Co Ltd filed Critical Beijing Kuangshi Robot Technology Co Ltd
Priority to CN202010286123.1A priority Critical patent/CN111652408A/en
Publication of CN111652408A publication Critical patent/CN111652408A/en
Pending legal-status Critical Current

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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Accounting & Taxation (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Game Theory and Decision Science (AREA)

Abstract

The disclosure provides an order processing method and device in a warehouse, a storage medium, electronic equipment and a warehouse management system, and relates to the technical field of logistics warehousing. The method comprises the following steps: acquiring a current first target order in a warehouse; determining a first score of each first target commodity for each site according to the busyness of each site, and determining an initial site corresponding to each first target commodity according to the first score, wherein the first target commodity is a commodity in the first target order; and dispatching and carrying equipment carries each first target commodity from the corresponding starting station to the corresponding feeding port of the first target order so as to complete the processing of the first target order. The method and the device can optimize order distribution globally, avoid the situation of local task accumulation and improve order processing efficiency.

Description

Order processing method, device, medium, electronic equipment and system in warehouse
Technical Field
The present disclosure relates to the field of logistics storage technologies, and in particular, to an order processing method in a warehouse, an order processing apparatus in a warehouse, a computer-readable storage medium, an electronic device, and a warehouse management system.
Background
In a large-scale storage scene such as an e-commerce scene and a supermarket scene, the work of picking and carrying commodities from a warehouse and the like is often required according to orders. With the spread of Automated works, Automated handling equipment such as AGVs (Automated guided vehicles) is increasingly used in warehouses to perform the above-described works.
In the related art, the order is processed mainly by considering the principle of proximity, such as sorting the required goods from the nearest station and carrying the goods to the corresponding feeding port. However, this method only considers the proximity in distance, and cannot optimize the order globally, so it has a certain limitation; particularly, when the distribution of warehouse layout and stations and feeding ports is complex, local tasks are easily accumulated when stations are distributed nearby, and therefore order processing efficiency is affected.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The present disclosure provides an order processing method in a warehouse, an order processing apparatus in a warehouse, a computer-readable storage medium, an electronic device, and a warehouse management system, thereby improving order processing efficiency in a warehouse at least to some extent.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the present disclosure, there is provided an order processing method in a warehouse, comprising: acquiring a current first target order in a warehouse; determining a first score of each first target commodity for each site according to the busyness of each site, and determining an initial site corresponding to each first target commodity according to the first score, wherein the first target commodity is a commodity in the first target order; and dispatching and carrying equipment carries each first target commodity from the corresponding starting station to the corresponding feeding port of the first target order so as to complete the processing of the first target order.
Optionally, the method further includes: acquiring a current second target order in the warehouse; determining a second score of each second target commodity for each station according to the busyness of each station and/or the busyness of a cargo channel where a feeding port corresponding to the second target order is located, and determining an initial station corresponding to each second target commodity according to the second score, wherein the second target commodity is a commodity in the second target order; and dispatching and carrying equipment carries each second target commodity from the corresponding starting station to the corresponding feeding port of the second target order so as to complete the processing of the second target order.
Optionally, after the processing of the first target order is completed, the processing of the second target order is started again.
Optionally, the determining a first score of each first target commodity for each site according to the busyness of each site includes: and determining a first score of each station for the commodities in the first target order according to the busyness of each station and the distance from each station to the feeding port corresponding to the first target order.
Optionally, the first score is determined by:
Figure BDA0002448572970000021
wherein U represents a first target order U, and o represents a commodity o in the first target order U; p1(o,Si) Indicating product o to site SiA first score of (a); h (U) represents a feeding port corresponding to the first target order U; dist (S)iH (U)) represents site SiDistance to feed port h (u); l (S)i) Indicating site SiBusyness of (2); l isSRepresenting the busyness upper limit value of the station; w is a1And w2Are all preset weights; k is a radical of1Is the first base coefficient, k1Greater than or equal to 0.
Optionally, when the starting site corresponding to the first target commodity is determined, the first target orders are sorted according to the remaining order taking time of the first target orders, and the corresponding starting site is determined for the first target commodity in each of the first target orders in sequence.
Optionally, determining a second score of each second target commodity for each station according to the busyness of each station and the busyness of a cargo channel where a feed port corresponding to the second target order is located, includes: and determining a second score of the commodity in the second target order to each station according to one or more of the busyness of each station, the distance from each station to the feeding port corresponding to the second target order and the busyness of the cargo channel where the feeding port corresponding to the second target order is located.
Optionally, the second score is determined by:
Figure BDA0002448572970000031
wherein N represents a second target order N, and o represents a commodity o in the second target order N; p2(o,Si) Indicating product o to site SiA second score of (a); h (N) represents a feeding port corresponding to the second target order N; dist (S)iH (N)) represents site SiDistance to feed port h (n); l (S)i) Indicating site SiBusyness of (2); l isSRepresenting the busyness upper limit value of the station; r (N) represents a cargo channel where a feeding port H (N) is located; l (R (N)) represents the busyness of the cargo way R (N); l isRAn upper limit value of the busyness of the goods channel is represented; qT(N) Total number of items, Q, of second target order NC(N) represents the number of items currently outstanding in the second target order N; w is a3、w4、w5And w6Are all preset weights; k is a radical of2Is the second base coefficient, k3Is the third base coefficient, k2And k3Are all greater than or equal to 0.
Optionally, the first target order and the second target order are determined by: acquiring all current orders to be processed in a warehouse; determining the to-be-processed order with the remaining order intercepting time smaller than a time threshold as a first target order; and determining the to-be-processed order with the remaining order taking time larger than the time threshold value as a second target order.
According to a second aspect of the present disclosure, there is provided an order processing apparatus in a warehouse, comprising: the order acquisition module is used for acquiring a current first target order in the warehouse; the first distribution module is used for determining a first score of each first target commodity for each site according to the busyness of each site, and determining an initial site corresponding to each first target commodity according to the first score, wherein the first target commodity is a commodity in the first target order; and the first scheduling module is used for scheduling the carrying equipment to carry each first target commodity from the corresponding starting station to the corresponding feeding port of the first target order so as to complete the processing of the first target order.
Optionally, the order obtaining module is further configured to obtain a current second target order in the warehouse; the device further comprises: the second distribution module is used for determining a second score of each second target commodity for each station according to the busyness of each station and the busyness of a cargo channel where a feeding port corresponding to the second target order is located, and determining an initial station corresponding to each second target commodity according to the second score, wherein the second target commodity is a commodity in the second target order; and the second scheduling module is used for scheduling the carrying equipment to carry each second target commodity from the corresponding starting station to the corresponding feeding port of the second target order so as to complete the processing of the second target order.
According to a third aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements any of the above-described order processing methods in a warehouse.
According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform any of the above-described order processing methods in the warehouse via execution of the executable instructions.
According to a fifth aspect of the present disclosure, there is provided a warehouse management system comprising: the website is used for providing the commodities in the order; the feeding port is used for conveying the commodities to the corresponding packing area after the commodities are fed into the feeding port; the conveying equipment is used for conveying the commodities from the station to the feeding port; and an electronic apparatus as in the fourth aspect above.
The technical scheme of the disclosure has the following beneficial effects:
according to the order processing method and device, the computer readable storage medium, the electronic device and the warehouse management system in the warehouse, a current first target order in the warehouse is obtained, the first score of each commodity to each site is calculated for the first target order, an initial site is determined, and the first target commodity is carried through the initial site. The method can realize the most convenient carrying of the commodities, optimize order distribution from the whole situation, avoid the condition of local task accumulation and improve the order processing efficiency.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is apparent that the drawings in the following description are only some embodiments of the present disclosure, and that other drawings can be obtained from those drawings without inventive effort for a person skilled in the art.
FIG. 1 shows a partial schematic view of a warehouse in the exemplary embodiment;
FIG. 2 illustrates a flow chart of a method of order processing in a warehouse in the exemplary embodiment;
FIG. 3 illustrates a flow chart for dividing a first target order and a second target order in the exemplary embodiment;
fig. 4 is a block diagram showing the structure of an order processing apparatus in a warehouse in the present exemplary embodiment;
fig. 5 shows an electronic device for implementing the above method in the present exemplary embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The exemplary embodiment of the present disclosure first provides an order processing method in a warehouse, and application scenarios thereof include but are not limited to: when a user places an order to purchase a commodity on the e-commerce platform, the order is generated and synchronized to the warehouse system, and the order needs to be processed, so that the exemplary embodiment can be executed by a computer of the warehouse system.
Fig. 1 shows a partial schematic view of a warehouse in an exemplary embodiment of the present disclosure, including stations, feed ports, accessible areas, and lanes. Here, the station is an area where item picking is performed, is used to provide items in an order, and is also a starting point of item conveyance in the present exemplary embodiment. The carrying equipment carries the commodities from the station to the feeding port, puts the commodities into the feeding port, and carries the commodities to the corresponding packing area through the feeding port so as to carry out subsequent packing, sorting and final warehouse-out. As shown in fig. 1, the feeding ports are generally arranged in a row to form a continuous row of feeding areas. Accessible areas refer to areas within the warehouse where handling equipment, including but not limited to: AGVs, forklifts, robots, etc. The reachable area between the feeding ports is a cargo channel and is the area to be reached when the conveying equipment conveys the commodities from the station to the feeding ports. Usually, a conveyor is arranged in the warehouse, and each station is connected to a main conveyor belt of the conveyor through a slide way; when the commodities are delivered from the warehouse, the commodities are firstly carried to a conveyor from a goods shelf for centralized sorting; for each commodity, the commodity can be conveyed to different stations through the conveyor and then conveyed to the feed opening from the stations; the commodities reach the subsequent packing, sorting and delivery areas through the feeding port.
Based on the warehouse shown in fig. 1, the exemplary embodiment of the present disclosure provides an order processing method in the warehouse, which may be executed by an electronic device in the warehouse that is responsible for order task allocation and scheduling. For example, if all devices (including handling devices, conveyors, monitoring devices, etc.) in a warehouse are connected to the same network, and a central control device (such as a main control system of the warehouse) is provided in the network, each device in the network can be controlled to perform a specific task, and the central control device can perform the exemplary embodiment. The illustrative embodiment is mainly directed to the distribution and scheduling of the goods in the order from the station to the feeder port, so as to perform global optimization on the order task in the warehouse. The order processing method will be specifically described below with reference to fig. 2.
Fig. 2 shows a flow of an order processing method, which may include the following steps S210 to S230:
step S210, a current first target order in the warehouse is obtained.
The orders in this exemplary embodiment typically refer to warehouse orders, each order including one or more items that need to be shipped from a station to a feeder. The first target order is a higher priority order, typically an emergency order. In an alternative embodiment, a second target order currently in the warehouse may also be obtained, where the second target order corresponds to the first target order and is a lower priority order, generally referred to as a non-urgent order. The first target order and the second target order may be divided according to the attributes of the orders, for example, when the customer places an order, the first target order is selected from options of emergency, urgency, arrival of day, arrival of next day, and the like, or the material order related to emergency matters such as medical treatment, rescue, and the like is the first target order, and the rest are the second target order.
In an embodiment, the division may be further performed according to a time attribute, and as shown in fig. 3 in particular, the first target order and the second target order may be determined through the following steps S301 to S303:
step S301, all current orders to be processed in a warehouse are obtained;
step S302, determining the order to be processed with the remaining order intercepting time smaller than the time threshold as a first target order;
step S303, determining the to-be-processed order with the remaining order taking time greater than the time threshold as the second target order.
The pending order may be an order that has been generated but not completed for shipment. The remaining order taking time is a difference between the latest warehouse-out time required by the current distance, for example, orders are generally required to be warehouse-out within 24 hours, and if a certain order is generated before 20 hours, the remaining order taking time is 4 hours. It can be seen that the shorter the remaining order taking time, the more urgent the order is. Therefore, a time threshold may be set for distinguishing the first target order from the second target order, and the time threshold may be set according to experience or actual demand, for example, set to 5 hours, and the first target order is the one with the remaining order-taking time less than 5 hours, and the second target order is the other.
Step S220, determining a first score of each first target commodity for each site according to the busyness of each site, and determining a starting site corresponding to each first target commodity according to the first score.
And the commodities in the first target order are all first target commodities. After the commodities arrive at the conveyor, the commodities are intensively sorted. Each first target article may be passed by the conveyor to a different station for handling. In the exemplary embodiment, the busyness of the sites is considered to determine a first score of each first target commodity for each site, and the first score is a measure of how conveniently the first target commodity is carried through different sites. The first score may be a positive correlation index, that is, the higher the first score of the first target product to a certain station, the more convenient the first target product is to be transported from the station, in this case, the station with the highest first score is generally selected as the starting station corresponding to the first target product, that is, the first target product is transported to the corresponding starting station through the conveyor, and is transported from the starting station to the feed opening; the first score may be a negative correlation index, that is, the lower the first score of the first target product for a certain site, the more convenient the first target product is to be transported from the site, in this case, the site with the lowest first score is generally selected as the origin site corresponding to the first target product. The present disclosure is not limited thereto.
The busy degree is a comprehensive measure of the congestion degree, the number of tasks and the like of a corresponding area, and generally, the higher the busy degree of a certain area is, the longer the waiting time for processing a new order in the area is. The present exemplary embodiment may calculate busyness for the site and the lane, respectively. The busyness of a station will be described first.
In one embodiment, the busyness of a site includes, but is not limited to, the following factors: the number of the commodities stacked on the station can be counted, for example, the number of the commodities from the chute port to the platform of the station, namely, the number of the commodities stacked on the station; the number of the tasks to be processed in the current processing of the site comprises the tasks of order ex-warehouse or other tasks needing to occupy site resources such as warehousing; the current processing speed of the station may be different from the real-time speed of the commodity for each station due to different positions of each station (for example, a wider space around the station and a narrower space around the station), a dynamic environment change in the warehouse (for example, more conveying devices are arranged on a path beside the station at a certain moment in a back and forth manner), and the like, and the average processing speed may be calculated according to the number of tasks or the number of commodities processed by the station in the last period of time (for example, in the last 10 minutes, 30 minutes, and the like). After obtaining the values of the above factors, the process of synthesis may be performed, for example, normalization and weighting calculation may be performed, and finally the busyness is obtained.
In another embodiment, the waiting time of each task, which may be, for example, the time span from the arrival of the conveying equipment at the station area to the start of loading, among the tasks processed by each station in the last period of time (e.g., the last 10 minutes, 30 minutes, etc.), may be counted. And then calculating the average waiting time of each task as the busyness, wherein the longer the average waiting time is, the more busy the station is.
After the busyness of each site is obtained, a first score of each first target commodity for each site can be calculated according to a preset conversion relation, for example, a linear relation may be formed between the busyness and the first score. Other factors related to the first score may be considered in addition to the busyness of the station. In an alternative embodiment, the first score of the goods in the first object order for each station may be determined according to the busyness of each station and/or the distance from each station to the corresponding dog house of the first object order. For example, the higher the busyness of a station, the further the distance from the feeder, the higher the first score of the first target item for that station, indicating that it is less convenient to carry the first target item from that station.
Further, the first score may be calculated by the following equation (1):
Figure BDA0002448572970000081
wherein U represents the first target order U, and o represents the product o in the first target order U, that is, formula (1) can be adopted for any product o in U. P1(o,Si) Indicating product o to site SiComprises two parts: distance and station busyness.
H (U) denotes a dog port corresponding to the first target order U, dist (S)iH (U)) represents site SiDistance to the feed opening h (u). L (S)i) Indicating site SiBusyness of (2); l isSThe busyness upper limit value of the station is represented and can be obtained from historical experience data, and the busyness upper limit value of the station is subjected to ratio calculation, which is equivalent to calculating the relative busyness of the station, so that the busyness is easy to be unified to the same numerical scale for calculation.
w1And w2The weights are preset weights which can be set according to experience or actual requirements and are used for weighting and integrating two numerical values of distance and station busyness, and w is1And w2It may also serve as a normalization, so w1And w2The sum is not necessarily 1. k is a radical of1Is the first base coefficient, k1And if the value is greater than or equal to 0, a smaller value (such as 1) greater than 0 can be generally taken, and the result of the busyness of the station is ensured to be greater than 0, so that the weighting calculation is facilitated.
Based on formula (1), when a certain first target commodity is processed, a first score may be obtained for all sites, and then a site with the lowest first score may be selected as a starting site of the first target commodity. It can be seen that if a certain station is busy, the first score is high, and the station is not used as the starting station of the commodity, that is, the order task is not allocated to the station, so that the pressure of the station is relieved, and the task accumulation in the area of the station is avoided.
Step S230, the dispatching and transporting device transports each first target commodity from the corresponding starting station to the corresponding material inlet of the first target order, so as to complete the processing of the first target order.
In the exemplary embodiment, each order has a defined corresponding relationship with the feeder. Generally, different feeding ports correspond to different packing areas or delivery areas and the like, when an order is generated, which of a large package, a medium package or a small package the order belongs to can be determined according to the commodity quantity, the commodity size and the commodity weight of the order, and then which feeding port the order needs to be delivered is determined, and which feeding port the order needs to be delivered is determined according to the address of the order and then the delivery area is delivered from, and the like. Each order typically corresponds to one feeder, and may correspond to multiple feeders if the order has a very large number of items, which is not limited by the present disclosure.
After the initial station is determined, the conveyor can be controlled to convey the first target commodity to the initial station, and then the conveying equipment loads the commodity at the initial station and conveys the commodity to the corresponding feeding port of the first target order.
In the exemplary embodiment, a current first target order in the warehouse is acquired, a first score of each commodity for each site is calculated for the first target order, an initial site is determined, and the first target commodity is carried through the initial site. The method can realize the most convenient carrying of the commodities, optimize order distribution from the whole situation, avoid the condition of local task accumulation and improve the order processing efficiency.
In an alternative embodiment, in step S220, the first target orders may be sorted according to the remaining order-taking time of the first target orders, the first target orders with shorter remaining order-taking time are ranked to earlier positions, and then the corresponding starting station is determined for the first target goods in each of the first target orders in turn. For example, a first target order 1 comprises 5 commodities, a first score for each site is calculated for the 1 st commodity, and the site with the lowest first score is determined as an initial site; dispatching and carrying equipment to carry the 1 st commodity from the starting station to a feeding port corresponding to the first target order 1; meanwhile, the busyness of each site is updated, the first score of the 2 nd commodity in the first target order 1 for each site is calculated, and the starting site … … is determined for the 2 nd commodity, namely, one commodity is processed each time, the busyness of the site is updated at the same time, and the next commodity is processed. Or, the first score of the first target product to each site is periodically updated according to a certain rule, for example, the first score is updated every 10 minutes, every half hour, or when a certain number of new first target orders are reached, the first score is updated. And when updating, calculating the latest first score based on the busyness of the latest site, thereby realizing the dynamic optimal scheduling of the first target order.
In an alternative embodiment, the processing of the second target order may include the following steps S240 to S260:
step S240, obtain the current second target order in the warehouse.
As previously described, the second target order may be determined by dividing all pending orders in the warehouse. It may also be determined whether the order belongs to a first target order or a second target order based on the attributes when the order is generated, the second target order being placed in a particular set, queue or library, from which the second target order is obtained when processed.
And S250, determining a second score of each second target commodity for each station according to the busyness of each station and/or the busyness of a cargo channel where a feeding port corresponding to the second target order is located, and determining an initial station corresponding to each second target commodity according to the second score.
And the commodities in the second target order are all second target commodities. When the second target order is processed, each second target commodity is used for calculating a second score for each site, and the second score is used for measuring the convenience degree of carrying the second target commodity through different sites. It should be noted that the meaning and the action of the first score and the second score are basically the same, but the difference is that the first score is for the first target commodity, the second score is for the second target commodity, and the calculation methods of the two indexes have a certain difference. The second score may be a positive correlation index, that is, the higher the second score of the second target commodity for a certain station, the more convenient the second target commodity is to be transported from the station, in this case, the station with the highest second score is generally selected as the starting station corresponding to the second target commodity, that is, the second target commodity is transported to the corresponding starting station through the conveyor, and is transported from the starting station to the feed opening; the second score may be a negative correlation index, that is, the lower the second score of the second target product for a certain site, the more convenient the second target product is to be transported from the site, and in this case, the site with the lowest second score is generally selected as the origin site corresponding to the second target product. The present disclosure is not limited thereto.
It can be seen that the second score differs from the first score primarily in that: the second score takes into account the busyness of the channel in which the inlet is located. The busyness of the cargo channel is similar to that of the station, but there is a certain difference, and the busyness of the station is not described any more, and a method for representing and calculating the busyness of the station in step S220 may be adopted, and the busyness of the cargo channel is specifically described below.
In one embodiment, the busyness of the cargo channel includes, but is not limited to, the following factors: the number of the carrying devices in the cargo channel can be counted through monitoring images, for example, the current number of the carrying devices in each cargo channel can be counted, and the congestion degree of the cargo channel can be represented; the average running speed of the conveying equipment in the cargo channel represents the congestion degree of the cargo channel; the number of tasks to be processed in the current processing, including tasks needing to occupy goods channel resources, such as ex-warehouse tasks or in-warehouse tasks; the current throughput speed of the lane may be different for each lane in real time similarly to the station, and the present exemplary embodiment may calculate the average processing speed by the number of tasks performed by the lane in the last period of time (e.g., the last 10 minutes, 30 minutes, etc.), the number of articles being handled (the sum of the number of articles on the shelf and the number of articles off the shelf), or the number of incoming and outgoing movements of the transporting apparatus. After obtaining the values of the above factors, the process of synthesis may be performed, for example, normalization and weighting calculation may be performed, and finally the busyness is obtained.
In another embodiment, the waiting time of each handling device in the tasks processed by each lane in the last period of time (such as the last 10 minutes, 30 minutes, etc.) can be counted. The latency may be determined by: waiting time for the carrying equipment to queue into the cargo channel, namely time taken from queuing to enter the cargo channel; the longer the time span of the same transporting equipment driving into the cargo channel and driving out of the cargo channel, generally, the longer the time, the longer the waiting time of the transporting equipment in the cargo channel is, for the warehousing task, specifically, the normal task time can be set, which means the time taken by the transporting equipment driving into the cargo channel and driving out of the cargo channel after executing the task under the condition of no congestion, and the normal task time is subtracted from the time span of driving into the cargo channel and driving out of the cargo channel to obtain the waiting time. Then, the average waiting time of each handling device is calculated as the degree of busyness, and the longer the average waiting time, the busyness of the cargo lane is indicated.
After the busyness of the sites and the busyness of the goods channel are obtained, a second score of each second target commodity for each site can be obtained through calculation according to a preset calculation relation, for example, the busyness of the sites and the busyness of the goods channel can be weighted to obtain a second score. In addition to the busyness of the stations and the busyness of the lane, other factors related to the second score may be considered. In an optional implementation manner, a second score of a commodity in the second target order for each station may be determined according to one or more of the busyness of each station, the distance between each station and a feeding port corresponding to the second target order, and the busyness of a cargo channel where the feeding port corresponding to the second target order is located. In other words, when calculating the second score, the factor of the distance from each station to the feeding port is added, so that the second score mainly consists of three parts of the busyness of the stations, the distance and the busyness of the cargo channel, and for example, the numerical values of the three parts can be weighted to obtain the second score.
Further, the second score may be calculated by the following equation (2):
Figure BDA0002448572970000121
wherein N represents the second target order N, and o represents the product o in the second target order N, that is, formula (2) may be adopted for any product o in the second target order N. P2(o,Si) Representing a Commodity o to a siteSiA second score of (a), which includes four components: distance, busyness of sites, busyness of lanes, and order quantity.
H (N) represents a feeding port corresponding to the second target order N; dist (S)iH (N)) represents site SiDistance from the feed opening H (N). L (S)i) Indicating site SiBusyness of (2); l isSIndicating the busyness upper limit of the station. R (N) represents a cargo channel where a feeding port H (N) is located; l (R (N)) represents the busyness of the cargo way R (N); l isRThe busyness upper limit value of the goods channel is represented and can be obtained from historical experience data, the busyness upper limit value is similar to the busyness of the station, and the busyness is easy to be calculated on the same numerical scale by calculating the ratio of the busyness upper limit value of the goods channel, which is equivalent to calculating the relative busyness of the goods channel. QT(N) Total number of items, Q, of second target order NC(N) represents the number of items currently outstanding in the second target order N, and as can be seen, the fewer the number of items outstanding in N,
Figure BDA0002448572970000122
the smaller the value of (a), the smaller the second score. It can be seen that the item of the order commodity quantity condition is increased in the formula (2), so that the second target order with less number of unfinished commodities has a lower second score, and is processed preferentially. I.e., the system prioritizes those second target orders that are close to completion.
w3、w4、w5And w6All the weights are preset weights which can be set according to experience or actual requirements and are used for carrying out weighted integration on the four partial values, and w3、w4、w5And w6It may also serve as a normalization, so w3、w4、w5And w6The sum is not necessarily 1. k is a radical of2Is the second base coefficient, k3Is the third base coefficient, k2And k3The number of the stations is greater than or equal to 0, and a smaller number (such as 1) greater than 0 can be taken, so that the result of the busyness of the stations and the result of the busyness of the goods channels are respectively greater than 0, and the weighting calculation is convenient.k1、k2And k3The numerical values of (A) may be the same or different.
Based on the formula (2), when a certain second target commodity is processed, the second score may be obtained for all sites, and then the site with the lowest second score is selected as the starting site of the second target commodity. It can be seen that if a certain station or a certain lane is busy, the second score is high, and the station is not used as the starting station of the commodity, that is, the order task is not allocated to the station, or the order task of the lane is not executed immediately, so that the pressure of the station or the lane is relieved, and the task accumulation in the station or the lane area is avoided.
Step S260, the dispatching and transporting device transports each second target commodity from the corresponding starting station to the corresponding feeding port of the second target order, so as to complete the processing of the second target order.
After the initial station is determined, the conveyor can be controlled to convey the second target commodity to the initial station, and then the commodity is loaded at the initial station by the conveying equipment and conveyed to the corresponding feeding port of the second target order.
In one embodiment, all of the second target orders may also be sorted, for example, in order of remaining order taking time from short to long, and then each second target order is processed in turn. That is, after all the commodities in one second target order are processed, the next second target order is processed.
In another embodiment, the plurality of second target orders may be processed in an interlaced manner, for example, all the commodities in all the second target orders form a queue, after the 1 st commodity of the second target order 1 is processed, the second score of each station is calculated for all the remaining commodities, the commodity with the lowest second score is selected and arranged at the head of the queue as the next processed commodity, and so on until all the second target commodities are processed.
Similarly, when the second target order is processed, since the busyness of the sites and the goods lane changes in real time, the second score of the second target commodity on each site can be periodically updated, so as to realize the dynamic optimal scheduling of the second target order.
In an alternative embodiment, all first target orders may be prioritized and processing of second target orders may begin when all first target orders are processed.
According to the method, the orders are divided into the first target order and the second target order and are processed in a layering mode, emergency and non-emergency situations of the orders are considered, and the order processing efficiency is further improved. In addition, for the first target order, centralized optimization processing is carried out based on the station busyness, and for the second target order, global optimization processing is carried out by integrating the station busyness and the cargo way busyness, so that the scheme has strong pertinence and can meet diversified requirements in practical application.
The exemplary embodiments of the present disclosure also provide an order processing apparatus in a warehouse. As shown in fig. 4, the order processing apparatus 400 may include:
an order obtaining module 410, configured to obtain a current first target order in the warehouse;
the first distribution module 420 is configured to determine a first score of each first target commodity for each site according to the busyness of each site, and determine an initial site corresponding to each first target commodity according to the first score, where the first target commodity is a commodity in a first target order;
the first scheduling module 430 is configured to schedule the transporting device to transport each first target product from the corresponding starting station to the corresponding feeding port of the first target order, so as to complete the processing of the first target order.
In an alternative embodiment, the order obtaining module 410 is further configured to obtain a current second target order in the warehouse. The order processing apparatus 400 may further include:
the second allocating module 440 is configured to determine a second score of each second target commodity for each station according to the busyness of each station and the busyness of the cargo channel where the material inlet corresponding to the second target order is located, and determine an initial station corresponding to each second target commodity according to the second score, where the second target commodity is a commodity in the second target order;
the second scheduling module 450 is configured to schedule the transporting device to transport each second target product from the corresponding starting station to the corresponding material inlet of the second target order, so as to complete the processing of the second target order.
In an alternative embodiment, the first distribution module 420 is configured to:
and determining a first score of each station for the commodities in the first target order according to the busyness of each station and/or the distance from each station to the feeding port corresponding to the first target order.
In an alternative embodiment, the first score is determined by:
Figure BDA0002448572970000141
wherein U represents a first target order U, and o represents a commodity o in the first target order U; p1(o,Si) Indicating product o to site SiA first score of (a); h (U) represents a feeding port corresponding to the first target order U; dist (S)iH (U)) represents site SiDistance to feed port h (u); l (S)i) Indicating site SiBusyness of (2); l isSRepresenting the busyness upper limit value of the station; w is a1And w2Are all preset weights; k is a radical of1Is the first base coefficient, k1Greater than or equal to 0.
In an optional implementation manner, the first allocating module 420 is further configured to, when determining a starting station corresponding to the first target product, sort the first target orders according to the remaining order taking time of the first target orders, and sequentially determine the corresponding starting station for the first target product in each of the first target orders.
In an optional implementation, the second allocating module 440 is configured to:
and determining a second score of the commodity in the second target order to each station according to one or more of the busyness of each station, the distance from each station to the feeding port corresponding to the second target order and the busyness of the cargo channel where the feeding port corresponding to the second target order is located.
In an alternative embodiment, the second score is determined by:
Figure BDA0002448572970000151
wherein N represents a second target order N, and o represents a commodity o in the second target order N; p2(o,Si) Indicating product o to site SiA second score of (a); h (N) represents a feeding port corresponding to the second target order N; dist (S)iH (N)) represents site SiDistance to feed port h (n); l (S)i) Indicating site SiBusyness of (2); l isSRepresenting the busyness upper limit value of the station; r (N) represents a cargo channel where a feeding port H (N) is located; l (R (N)) represents the busyness of the cargo way R (N); l isRAn upper limit value of the busyness of the goods channel is represented; qT(N) Total number of items, Q, of second target order NC(N) represents the number of items currently outstanding in the second target order N; w is a3、w4、w5And w6Are all preset weights; k is a radical of2Is the second base coefficient, k3Is the third base coefficient, k2And k3Are all greater than or equal to 0.
In an alternative embodiment, the order taking module 410 is configured to:
acquiring all current orders to be processed in a warehouse;
determining the to-be-processed order with the remaining order intercepting time smaller than a time threshold as a first target order;
and determining the order to be processed with the remaining order taking time larger than the time threshold value as a second target order.
The specific details of each module in the above apparatus have been described in detail in the method section, and details that are not disclosed may refer to the method section, and thus are not described again.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
Exemplary embodiments of the present disclosure also provide a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing an electronic device to perform the steps according to various exemplary embodiments of the disclosure described in the above-mentioned "exemplary methods" section of this specification, when the program product is run on the electronic device. The program product may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on an electronic device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a 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.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A 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 (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, 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.
A computer readable signal medium may include a propagated data signal with 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 readable signal medium may also be any readable medium that is not a 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 readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like 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 computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The exemplary embodiment of the present disclosure also provides an electronic device capable of implementing the above method. An electronic device 500 according to this exemplary embodiment of the present disclosure is described below with reference to fig. 5. The electronic device 500 shown in fig. 5 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 5, the electronic device 500 may take the form of a general purpose computing device. The components of the electronic device 500 may include, but are not limited to: at least one processing unit 510, at least one memory unit 520, a bus 530 that couples various system components including the memory unit 520 and the processing unit 510, and a display unit 540.
The memory unit 520 stores program code that may be executed by the processing unit 510 to cause the processing unit 510 to perform steps according to various exemplary embodiments of the present disclosure as described in the "exemplary methods" section above in this specification. For example, processing unit 510 may perform the method steps shown in fig. 2 or fig. 3.
The storage unit 520 may include readable media in the form of volatile storage units, such as a random access memory unit (RAM)521 and/or a cache memory unit 522, and may further include a read only memory unit (ROM) 523.
The storage unit 520 may also include a program/utility 524 having a set (at least one) of program modules 525, such program modules 525 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Bus 530 may be one or more of any of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 500 may also communicate with one or more external devices 600 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 500, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 500 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 550. Also, the electronic device 500 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 560. As shown, the network adapter 560 communicates with the other modules of the electronic device 500 over the bus 530. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 500, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Exemplary embodiments of the present disclosure also provide a warehouse management system, which may include the station, the material feeding port, the handling device, and the electronic device. The site is used for providing commodities in the order; the feeding port is used for conveying the commodities to the corresponding packing area after the commodities are fed into the feeding port; the carrying equipment is used for carrying the commodities from the station to the feeding port; the electronic device may perform optimization processing on the first target order and the second target order by executing the order processing method in the exemplary embodiment, as shown in fig. 5.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the exemplary embodiments of the present disclosure.
Furthermore, the above-described figures are merely schematic illustrations of processes included in methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit, according to exemplary embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is to be limited only by the terms of the appended claims.

Claims (13)

1. A method of order processing in a warehouse, comprising:
acquiring a current first target order in a warehouse;
determining a first score of each first target commodity for each site according to the busyness of each site, and determining an initial site corresponding to each first target commodity according to the first score, wherein the first target commodity is a commodity in the first target order;
and dispatching and carrying equipment carries each first target commodity from the corresponding starting station to the corresponding feeding port of the first target order so as to complete the processing of the first target order.
2. The method of claim 1, further comprising:
acquiring a current second target order in the warehouse;
determining a second score of each second target commodity for each station according to the busyness of each station and/or the busyness of a cargo channel where a feeding port corresponding to the second target order is located, and determining an initial station corresponding to each second target commodity according to the second score, wherein the second target commodity is a commodity in the second target order;
and dispatching and carrying equipment carries each second target commodity from the corresponding starting station to the corresponding feeding port of the second target order so as to complete the processing of the second target order.
3. The method of claim 2, wherein processing the second target order is resumed after processing of the first target order is completed.
4. The method of claim 1, wherein determining a first score for each first target good for each site based on the busyness of the site comprises:
and determining a first score of each station for the commodities in the first target order according to the busyness of each station and/or the distance from each station to a feeding port corresponding to the first target order.
5. The method of claim 4, wherein the first score is determined by:
Figure FDA0002448572960000011
wherein U represents a first target order U, and o represents a commodity o in the first target order U; p1(o,Si) Indicating product o to site SiA first score of (a); h (U) represents a feeding port corresponding to the first target order U; dist (S)iH (U)) represents site SiDistance to feed port h (u); l (S)i) Indicating site SiBusyness of (2); l isSRepresenting the busyness upper limit value of the station; w is a1And w2Are all preset weights; k is a radical of1Is the first base coefficient, k1Greater than or equal to 0.
6. The method according to claim 1, wherein when determining the starting site corresponding to the first target goods, the first target orders are sorted according to remaining order-taking time of the first target orders, and the corresponding starting site is determined for the first target goods in each of the first target orders in turn.
7. The method according to claim 2, wherein the determining a second score of each second target commodity for each station according to the busyness of each station and/or the busyness of a cargo channel where a dog house corresponding to the second target order is located comprises:
and determining a second score of the commodity in the second target order to each station according to one or more of the busyness of each station, the distance from each station to the feeding port corresponding to the second target order and the busyness of the cargo channel where the feeding port corresponding to the second target order is located.
8. The method of claim 7, wherein the second score is determined by:
Figure FDA0002448572960000021
wherein N represents a second target order N, and o represents a commodity o in the second target order N; p2(o,Si) Indicating product o to site SiA second score of (a); h (N) represents a feeding port corresponding to the second target order N; dist (S)iH (N)) represents site SiDistance to feed port h (n); l (S)i) Indicating site SiBusyness of (2); l isSRepresenting the busyness upper limit value of the station; r (N) represents a cargo channel where a feeding port H (N) is located; l (R (N)) represents the busyness of the cargo way R (N); l isRAn upper limit value of the busyness of the goods channel is represented; qT(N) Total number of items, Q, of second target order NC(N) represents the number of items currently outstanding in the second target order N; w is a3、w4、w5And w6Are all preset weights; k is a radical of2Is the second base coefficient, k3Is the third base coefficient, k2And k3Are all greater than or equal to 0.
9. The method of claim 2, wherein the first and second target orders are determined by:
acquiring all current orders to be processed in a warehouse;
determining the to-be-processed order with the remaining order intercepting time smaller than a time threshold as a first target order;
and determining the to-be-processed order with the remaining order taking time larger than the time threshold value as a second target order.
10. An order processing apparatus in a warehouse, comprising:
the order acquisition module is used for acquiring a current first target order in the warehouse;
the first distribution module is used for determining a first score of each first target commodity for each site according to the busyness of each site, and determining an initial site corresponding to each first target commodity according to the first score, wherein the first target commodity is a commodity in the first target order;
and the first scheduling module is used for scheduling the carrying equipment to carry each first target commodity from the corresponding starting station to the corresponding feeding port of the first target order so as to complete the processing of the first target order.
11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 1 to 9.
12. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the method of any of claims 1 to 9 via execution of the executable instructions.
13. A warehouse management system, the system comprising:
the website is used for providing the commodities in the order;
the feeding port is used for conveying the commodities to the corresponding packing area after the commodities are fed into the feeding port;
the conveying equipment is used for conveying the commodities from the station to the feeding port; and
the electronic device of claim 12.
CN202010286123.1A 2020-04-13 2020-04-13 Order processing method, device, medium, electronic equipment and system in warehouse Pending CN111652408A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010286123.1A CN111652408A (en) 2020-04-13 2020-04-13 Order processing method, device, medium, electronic equipment and system in warehouse

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010286123.1A CN111652408A (en) 2020-04-13 2020-04-13 Order processing method, device, medium, electronic equipment and system in warehouse

Publications (1)

Publication Number Publication Date
CN111652408A true CN111652408A (en) 2020-09-11

Family

ID=72350350

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010286123.1A Pending CN111652408A (en) 2020-04-13 2020-04-13 Order processing method, device, medium, electronic equipment and system in warehouse

Country Status (1)

Country Link
CN (1) CN111652408A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200118071A1 (en) * 2018-10-13 2020-04-16 Walmart Apollo, Llc Delivery prediction generation system
CN113869808A (en) * 2021-12-03 2021-12-31 青岛盈智科技有限公司 Task balance scheduling method, device and system
CN113935612A (en) * 2021-10-09 2022-01-14 福州大学 Emergency order logistics scheduling method for steel industry

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014133643A (en) * 2013-01-11 2014-07-24 Seibu Electric & Mach Co Ltd Commodity sorting system and commodity sorting method
CN108009869A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Order processing method, apparatus, server and computer-readable recording medium
CN108846609A (en) * 2018-06-15 2018-11-20 北京极智嘉科技有限公司 Picking method, device, server and medium based on order taking responsibility
CN109772714A (en) * 2017-11-10 2019-05-21 北京京东尚科信息技术有限公司 Cargo picking method and device, storage medium, electronic equipment
CN109978423A (en) * 2017-12-28 2019-07-05 北京京东尚科信息技术有限公司 Inventory's dispatching method, device and computer readable storage medium
CN110033337A (en) * 2018-01-11 2019-07-19 北京京东尚科信息技术有限公司 The method and apparatus of order production
CN110097414A (en) * 2018-01-31 2019-08-06 北京京东尚科信息技术有限公司 Order processing method and apparatus
CN110111033A (en) * 2018-02-01 2019-08-09 北京京东尚科信息技术有限公司 A kind of method and apparatus that order shunts
CN110197309A (en) * 2019-06-05 2019-09-03 北京极智嘉科技有限公司 Order processing method, apparatus, equipment and storage medium
CN110428118A (en) * 2019-09-04 2019-11-08 北京旷视机器人技术有限公司 Order processing method and device, warehousing system and computer storage medium
CN110826883A (en) * 2019-10-25 2020-02-21 北京旷视机器人技术有限公司 Order processing method and device
CN110929981A (en) * 2019-10-14 2020-03-27 北京旷视机器人技术有限公司 Order allocation method, device, system and storage medium

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014133643A (en) * 2013-01-11 2014-07-24 Seibu Electric & Mach Co Ltd Commodity sorting system and commodity sorting method
CN108009869A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Order processing method, apparatus, server and computer-readable recording medium
CN109772714A (en) * 2017-11-10 2019-05-21 北京京东尚科信息技术有限公司 Cargo picking method and device, storage medium, electronic equipment
CN109978423A (en) * 2017-12-28 2019-07-05 北京京东尚科信息技术有限公司 Inventory's dispatching method, device and computer readable storage medium
CN110033337A (en) * 2018-01-11 2019-07-19 北京京东尚科信息技术有限公司 The method and apparatus of order production
CN110097414A (en) * 2018-01-31 2019-08-06 北京京东尚科信息技术有限公司 Order processing method and apparatus
CN110111033A (en) * 2018-02-01 2019-08-09 北京京东尚科信息技术有限公司 A kind of method and apparatus that order shunts
CN108846609A (en) * 2018-06-15 2018-11-20 北京极智嘉科技有限公司 Picking method, device, server and medium based on order taking responsibility
CN110197309A (en) * 2019-06-05 2019-09-03 北京极智嘉科技有限公司 Order processing method, apparatus, equipment and storage medium
CN110428118A (en) * 2019-09-04 2019-11-08 北京旷视机器人技术有限公司 Order processing method and device, warehousing system and computer storage medium
CN110929981A (en) * 2019-10-14 2020-03-27 北京旷视机器人技术有限公司 Order allocation method, device, system and storage medium
CN110826883A (en) * 2019-10-25 2020-02-21 北京旷视机器人技术有限公司 Order processing method and device

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200118071A1 (en) * 2018-10-13 2020-04-16 Walmart Apollo, Llc Delivery prediction generation system
CN113935612A (en) * 2021-10-09 2022-01-14 福州大学 Emergency order logistics scheduling method for steel industry
CN113935612B (en) * 2021-10-09 2022-05-10 福州大学 Emergency order logistics scheduling method for iron and steel industry
CN113869808A (en) * 2021-12-03 2021-12-31 青岛盈智科技有限公司 Task balance scheduling method, device and system
CN113869808B (en) * 2021-12-03 2022-03-01 青岛盈智科技有限公司 Task balance scheduling method, device and system

Similar Documents

Publication Publication Date Title
US11182743B2 (en) Order processing method and device, server, and storage medium
CN110197350B (en) Article delivery method and device
CN108596540B (en) Replenishment method and device, computer-readable storage medium and electronic equipment
CN109658027B (en) Order task processing method, device, server and medium
CN106980955B (en) Method and apparatus for outputting information
CN108846609A (en) Picking method, device, server and medium based on order taking responsibility
CN111652408A (en) Order processing method, device, medium, electronic equipment and system in warehouse
JP2020502015A (en) Delivery method and equipment
CN109961247B (en) Method and device for generating article storage information
US11270371B2 (en) System and method for order packing
CN110390497B (en) Article warehouse-in method and device
JP2020042354A (en) Stock arrangement designing device and stock arrangement designing method
US20180260770A1 (en) System and method for item consolidation
CN110826953B (en) Warehouse storage equipment planning method and device
CN110390449A (en) Warehouse replenishing method and device
CN109683504B (en) Warehouse-out control method and device, electronic equipment and storage medium
CN111652407B (en) Task processing method, device, medium, electronic equipment and system in warehouse
CN111738492A (en) Container positioning method, device, equipment and storage medium
US11681983B2 (en) Systems and methods for prioritizing pick jobs while optimizing efficiency
CN111754152A (en) Goods shelf scheduling method and device for goods-to-person warehouse, electronic equipment and medium
CN112101831A (en) Goods delivery method, device, medium and electronic equipment
CN113627858A (en) Method and device for determining cache location of warehouse
CN111210074A (en) Order processing method, device, medium, electronic equipment and system in warehouse
CN112966992A (en) Order production method and device
CN115375243A (en) Order distribution method and device, electronic equipment and computer readable medium

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200911