Order sorting method, device and equipment and readable medium

By dynamically adjusting the order sorting time period, the problem of untimely sorting caused by too many appointment sorting orders and immediate sorting orders is solved, and the sorting efficiency and user experience are improved.

CN119692691APending Publication Date: 2025-03-25BEIJING JINGDONG TUOXIAN TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411766375.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-12-03
Publication Date
2025-03-25

AI Technical Summary

Technical Problem

During certain time periods, the total number of orders for booking and immediate sorting orders is too high, resulting in untimely sorting, which reduces the order sorting efficiency and user experience.

Method used

By determining the order type and predetermined sorting completion time of the order to be sorted, the sorting time period of the order is dynamically adjusted to ensure that after reaching the threshold number within the first time period, sorting is performed within the second time period.

Benefits of technology

It improves sorting efficiency, improves user experience, and ensures timely fulfillment of orders.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119692691A_ABST
    Figure CN119692691A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides an order sorting method, device and equipment and a readable medium. The method comprises the steps of determining an order type of a to-be-sorted target order and predetermined sorting completion time; determining a first time period matched with the predetermined sorting completion time in response to determining that the order type indicates the reserved sorting order; in response to determining that the first number of the first group of orders which have been ordered and sorted in the first time period reaches a first threshold number, determining whether the second number of the second group of orders which have been ordered and sorted in a second time period reaches a second threshold number, the second time period being before the first time period; and in response to determining that the second number of the second group of orders which have been ordered to be sorted within the second time period does not reach the second threshold number, executing sorting of the target order within the second time period. In this way, the sorting efficiency can be improved, and the user experience can be improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Example embodiments of the present disclosure generally relate to the field of computer technology, and more particularly, to methods, devices, apparatuses, and computer-readable storage media for order picking. Background Art

[0002] Since there is a certain degree of randomness in receiving immediate sorting orders, the total number of scheduled sorting orders and immediate sorting orders may be too large in certain time periods, resulting in untimely sorting, which not only reduces the sorting efficiency of the orders, but also worsens the user experience. Summary of the invention

[0003] In a first aspect of the present disclosure, a method for order sorting is provided. The method includes: determining an order type and a scheduled sorting completion time of a target order to be sorted; in response to determining that the order type indicates a scheduled sorting order, determining a first time period that matches the scheduled sorting completion time; in response to determining that a first number of a first group of orders that have been scheduled for sorting in the first time period has reached a first threshold number, determining whether a second number of a second group of orders that have been scheduled for sorting in a second time period has reached a second threshold number, the second time period being before the first time period; and in response to determining that the second number of the second group of orders that have been scheduled for sorting in the second time period has not reached the second threshold number, performing sorting of the target order in the second time period.

[0004] In a second aspect of the present disclosure, a device for order sorting is provided. The device includes: a determination module configured to determine the order type and the scheduled sorting completion time of the target order to be sorted; a matching module configured to determine a first time period that matches the scheduled sorting completion time in response to determining that the order type indicates a scheduled sorting order; an execution module configured to determine whether the second number of the second group of orders that have been scheduled for sorting in the first time period has reached a first threshold number in response to determining that the first number of the first group of orders that have been scheduled for sorting in the first time period has reached a first threshold number, and the second time period is before the first time period; and a sorting module configured to perform sorting of the target order in the second time period in response to determining that the second number of the second group of orders that have been scheduled for sorting in the second time period has not reached the second threshold number.

[0005] In a third aspect of the present disclosure, an electronic device is provided. The electronic device includes at least one processing unit; and at least one memory, the at least one memory is coupled to the at least one processing unit and stores instructions for execution by the at least one processing unit, and when the instructions are executed by the at least one processing unit, the electronic device executes the method of the first aspect of the present disclosure.

[0006] In a fourth aspect of the present disclosure, a computer-readable storage medium is provided, wherein a computer program is stored on the computer-readable storage medium, and the computer program can be executed by a processor to perform the method according to the first aspect of the present disclosure.

[0007] In a fifth aspect of the present disclosure, a computer program product is provided, comprising computer executable instructions, wherein the computer executable instructions can be executed by a processor to perform the method according to the first aspect of the present disclosure.

[0008] It should be understood that the contents described in the summary of the invention are not intended to limit the key features or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] In the following, in conjunction with the accompanying drawings and with reference to the following detailed description, the above and other features, advantages and aspects of various implementations of the present disclosure will become more apparent. In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, wherein:

[0010] Figure 1 A schematic diagram showing an example environment in which embodiments of the present disclosure can be implemented;

[0011] Figure 2 A flowchart showing a process of order picking in the same order queue according to some embodiments of the present disclosure;

[0012] Figure 3 A flowchart showing a process of order picking for different queues according to some embodiments of the present disclosure;

[0013] Figure 4 A flowchart showing a process of order counting according to some embodiments of the present disclosure;

[0014] Figure 5 A flowchart showing a process of order picking according to some embodiments of the present disclosure is shown;

[0015] Figure 6 A schematic structural block diagram showing an apparatus for order sorting according to certain embodiments of the present disclosure; and

[0016] Figure 7 A block diagram of an electronic device is shown in which one or more embodiments of the present disclosure may be implemented. DETAILED DESCRIPTION

[0017] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0018] In the description of the embodiments of the present disclosure, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The term "some embodiments" should be understood as "at least some embodiments". Other explicit and implicit definitions may also be included below.

[0019] It should be noted that the acquisition, storage and application of user personal information involved in the technical solution of the present disclosure are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0020] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0021] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information, so that the user can independently choose whether to provide personal information to software or hardware such as electronic devices, applications, servers or storage media that execute operations of the technical solution of the present disclosure based on the prompt message.

[0022] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information is sent to the user in a manner such as a pop-up window, in which the prompt information can be presented in text form. In addition, the pop-up window can also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0023] In the traditional order sorting solution, after the order is transmitted to the server, the server will calculate a score for the order according to the order type, and then determine the sorting order of the order in the order queue based on the score, because the order sorting must ensure first-in-first-out. If the order type is an immediate sorting order, the order placement time is used as the score; if the order type is an appointment sorting order, the expected delivery start time of the order is used as the score.

[0024] If there are too many appointment orders in a certain period of time, some immediate sorting orders may be delayed in sorting, thus affecting the fulfillment time of these orders. For example, if 10 appointment sorting orders with expected delivery start time in the time period of 9:00-10:00 are received at 8 o'clock in the morning, then it can be determined that the starting sorting time of these 10 orders is 9:00. In this case, if some immediate sorting orders are received at 9 o'clock, then these immediate sorting orders may be placed behind these 10 orders for production, causing sorting delays for these immediate sorting orders and reducing user experience.

[0025] In view of this, an embodiment of the present disclosure provides a solution for order sorting. The solution includes: determining the order type and the scheduled sorting completion time of the target order to be sorted; if it is determined that the order type indicates a scheduled sorting order, determining a first time period that matches the scheduled sorting completion time; if it is determined that the first number of the first group of orders that have been scheduled for sorting in the first time period has reached a first threshold number, determining whether the second number of the second group of orders that have been scheduled for sorting in the second time period has reached a second threshold number, and the second time period is before the first time period; if it is determined that the second number of the second group of orders that have been scheduled for sorting in the second time period has not reached the second threshold number, performing sorting of the target order in the second time period. In this way, sorting efficiency can be improved, and user experience can also be improved.

[0026] Figure 1 A schematic diagram of an example environment 100 is shown in which embodiments of the present disclosure can be implemented.

[0027] like Figure 1 As shown, the terminal device 110 can communicate with the server 130 to implement sorting of the target order 120. In some examples, the target order 120 can indicate any order that needs to be sorted, such as a clothing delivery order, a medicine delivery order, etc. It can be understood that this is merely exemplary and not restrictive.

[0028] The terminal device 110 can be any type of mobile terminal, fixed terminal or portable terminal, including mobile phones, desktop computers, laptop computers, notebook computers, netbook computers, tablet computers, media computers, multimedia tablets, personal communication systems (PCS) devices, personal navigation devices, personal digital assistants (PDAs), audio / video players, digital cameras / camcorders, positioning devices, television receivers, radio broadcast receivers, e-book devices, gaming devices, or any combination of the foregoing, including accessories and peripherals of these devices or any combination thereof. In some embodiments, the terminal device 110 can also support any type of interface for the user (such as "wearable" circuits, etc.). The server 130 can be various types of computing systems / servers that can provide computing power, including but not limited to mainframes, edge computing nodes, computing devices in cloud environments, and the like.

[0029] It should be understood that the structure and function of the various elements in the environment 100 are described for exemplary purposes only and do not imply any limitation on the scope of the present disclosure.

[0030] Some example embodiments of the present disclosure will be described below with reference to the accompanying drawings. In the following, the example embodiments will be described mainly with respect to the terminal device 110. It should be understood that the actions described with respect to the terminal device 110 can be performed by the terminal device 110 in collaboration with its service end (e.g., server 130).

[0031] Figure 2 1 is a flowchart showing a process 200 of order sorting in the same order queue according to some embodiments of the present disclosure. The process 200 may be implemented at the terminal device 110. For ease of discussion, reference will be made to Figure 1 The process 200 is described with reference to the environment 100 of FIG.

[0032] In some embodiments, the terminal device 110 can determine the order type and the scheduled sorting completion time of the target order 120 to be sorted. In some examples, the order type can indicate at least one of an appointment sorting order and an immediate sorting order. In other examples, the scheduled sorting completion time can be determined based on the expected delivery start time, sorting duration, delivery duration, and reserved duration of the target order 120 to be sorted. For example, assuming that the expected delivery start time of the target order 120 to be sorted is 10:00, the sorting duration is 5 minutes, the delivery duration is expected to be 20 minutes, and the reserved duration is 15 minutes, then the expected sorting completion time can be 9:20. It can be understood that this is merely exemplary and not restrictive.

[0033] In some embodiments, the terminal device 110 may determine at least one time period for sorting the target order 120. In some examples, the at least one time period may include time period 1, time period 2, time period 3, and time period 4. In some examples, each order queue may correspond to multiple time periods for sorting the target order 120.

[0034] like Figure 2 As shown, the order queue M includes target orders 120 to be sorted in four time periods, namely time period 1, time period 2, time period 3 and time period 4. Specifically, the target orders 120 to be sorted in time period 1 include immediate sorting order A and immediate sorting order B, the target orders 120 to be sorted in time period 2 include scheduled sorting order A1 and immediate sorting order C, the target orders 120 to be sorted in time period 3 include immediate sorting order D and scheduled sorting order D1, and the target orders 120 to be sorted in time period 4 include scheduled sorting order B1, scheduled sorting order C1, and immediate sorting order E.

[0035] In some examples, the first time period may indicate 9:00-9:30, the second time period may indicate 9:30-10:00, the third time period may indicate 10:00-10:30, and the fourth time period may indicate 10:30-11:00. It is understood that this is merely exemplary and not limiting.

[0036] In some embodiments, if it is determined that the order type indicates a scheduled sorting order, the terminal device 110 may determine a first time period that matches the scheduled sorting completion time. In some embodiments, the terminal device 110 may determine at least one time period for sorting the target order 120. If it is determined that the scheduled sorting completion time is within the time range indicated by the target time period in at least one time period, the target time period is determined as the first time period that matches the scheduled sorting completion time. For example, assume that the scheduled sorting completion time indicates 11:10, and the target time period indicates 11:00-11:30. In this case, the terminal device 110 may determine that the scheduled sorting completion time is within the time range indicated by the target time period, and then the first time period may be further determined to be 11:00-11:30. It will be understood that this is merely exemplary and not restrictive.

[0037] In some embodiments, if a timer task for calculating the number of orders to be sorted in at least one time period is started, the terminal device 110 can determine the current time and the counting time. In some examples, the counting time can be defined by waves. For example, the wave can be set to 30 minutes, and the counting time can be 30 minutes.

[0038] Further, the terminal device 110 may determine the counting start time corresponding to the current moment based on the first numerical value corresponding to the hour digit of the current moment and the counting duration. In some embodiments, the terminal device 110 determines the second numerical value corresponding to the minute digit of the current moment. The terminal device 110 determines the multiple based on the second numerical value and the counting duration. The terminal device 110 determines the product of the multiple and the counting duration. The terminal device 110 determines the counting start time based on the sum of the first numerical value and the product. Then, the terminal device 110 may determine at least one time period based on the counting start time and the counting duration.

[0039] In some examples, assuming that the current time is 17:28 and the counting duration is 30 minutes, the second value of the minute position of the current time can be obtained as 28 minutes, then the multiple (after rounding) calculated by the second value and the counting duration is 0, and then multiplied by the counting duration, the result is 0, so it is deduced that the counting start time of the current time is 17:00. In other examples, assuming that the current time is 17:31, when the counting duration is set to 30 minutes, the counting start time is 17:30. If the counting duration is configured to 20 minutes, the counting start time is 17:20. In some examples, after determining the counting start time, the time window is initialized. Specifically, each time period window corresponds to a time period. It can be understood that this is merely exemplary and not restrictive.

[0040] In some embodiments, if it is determined that a first number of a first group of orders that have been scheduled for sorting within a first time period has reached a first threshold number, the terminal device 110 can determine whether a second number of a second group of orders that have been scheduled for sorting within a second time period has reached a second threshold number, and the second time period is before the first time period.

[0041] In some embodiments, if it is determined that the second number of the second group of orders that have been scheduled for sorting within the second time period does not reach the second threshold number, the terminal device 110 can perform sorting of the target order 120 in the second time period. In some embodiments, at least one time period includes at least one candidate time period. In other embodiments, the second time period is determined in the following manner. Specifically, the terminal device 110 determines at least one candidate time period before the first time period. Then, the terminal device 110 selects the candidate time period with the shortest time distance from the first time period and the second number of which does not reach the second threshold number as the second time period from the at least one candidate time period.

[0042] In some embodiments, if it is determined that the second number of the second group of orders that have been scheduled for sorting in the second time period has reached the second threshold number, the terminal device 110 determines whether the third number of the third group of orders that have been scheduled for sorting in the third time period has reached the third threshold number, and the third time period is before the second time period. If it is determined that the third number of the third group of orders that have been scheduled for sorting in the third time period has not reached the third threshold number, the terminal device 110 performs sorting on the target order 120 in the third time period.

[0043] In some examples, if the number of orders scheduled for sorting in the group of orders (including the scheduled sorting order B1, the scheduled sorting order C1, and the immediate sorting order E) scheduled for sorting in time period 4 exceeds the threshold number (for example, 2) corresponding to time period 4, the terminal device 110 may adjust the scheduled sorting order B1 to sorting in time period 3. In this case, if the number of orders scheduled for sorting in the group of orders (including the immediate sorting order D, the scheduled sorting order D1, and the scheduled sorting order B1) scheduled for sorting in time period 3 exceeds the threshold number (for example, 2) corresponding to time period 3, the terminal device 110 may adjust the scheduled sorting order D1 to sorting in time period 2. Further, if the number of orders scheduled for sorting in the group of orders (including the scheduled sorting order A1, the immediate sorting order C, and the scheduled sorting order D1) scheduled for sorting in time period 2 exceeds the threshold number (for example, 2) corresponding to time period 2, if time period 1 is the initial time period, the terminal device 110 may adjust the scheduled sorting order A1 to sorting in time period 1.

[0044] Furthermore, if time period 1 is not the initial time period, that is, there are other time periods before time period 1, and the number of orders scheduled for sorting in the group of orders scheduled for sorting in time period 1 after the scheduled sorting order A1 is adjusted to time period 1 is greater than the threshold number corresponding to time period 1, the terminal device 110 can adjust one or more scheduled sorting orders in time period 1 to other time periods before time period 1 for sorting, until the number of orders scheduled for sorting in the adjusted time period is less than the corresponding threshold number or reaches the initial time period.

[0045] like Figure 2 As shown, after the above adjustment, the order queue M is changed to the order queue M1. Specifically, in the order queue M1, the target orders 120 to be sorted in time period 1 include immediate sorting order A, immediate sorting order B, and scheduled sorting order A1, the target orders 120 to be sorted in time period 2 include immediate sorting order C and scheduled sorting order D1, the target orders 120 to be sorted in time period 3 include immediate sorting order D and scheduled sorting order B1, and the target orders 120 to be sorted in time period 4 include scheduled sorting order C1 and immediate sorting order E.

[0046] After making the above adjustments to the target order 120 to be sorted, the terminal device 110 may assign the target order 120 to be sorted to the sorting execution object 210 to execute the sorting of the target order 120 .

[0047] Continue to refer to Figure 3 An example process of order picking for different queues is described.

[0048] Figure 3 1 is a flowchart showing a process 300 of order sorting for different queues according to some embodiments of the present disclosure. The process 300 may be implemented at the terminal device 110. For ease of discussion, reference will be made to Figure 1 The process 300 is described with reference to the environment 100 of FIG.

[0049] like Figure 3 As shown, in some examples, each order queue may correspond to a time period for sorting the target order 120. In some examples, there are four order queues, namely the first order queue 310, the second order queue 320, the third order queue 330, and the fourth order queue 340. Specifically, each order queue may correspond to a group of orders in a time period. In some examples, the first order queue 310 may correspond to a group of orders from 9:00 to 9:30, the second order queue 320 may correspond to a group of orders from 9:30 to 10:00, the third order queue 330 may correspond to a group of orders from 10:00 to 10:30, and the fourth order queue 340 may correspond to a group of orders from 10:30 to 11:00. It can be understood that this is merely exemplary and not restrictive.

[0050] Furthermore, there are eight scheduled sorting orders in the fourth order queue 340, namely, scheduled sorting order 1, scheduled sorting order 2, scheduled sorting order 3, scheduled sorting order 4, scheduled sorting order 5, scheduled sorting order 6, scheduled sorting order 7, and scheduled sorting order 8. Assume that the threshold number of each order queue is 2. Then it can be determined first that the six orders of scheduled sorting order 1, scheduled sorting order 2, scheduled sorting order 3, scheduled sorting order 4, scheduled sorting order 5, and scheduled sorting order 6 are adjusted to the other three order queues for sorting. Scheduled sorting order 7 and scheduled sorting order 8 are sorted in the time period (10:30-11:00) corresponding to the fourth order queue 340.

[0051] Specifically, the scheduled sorting order 5 and the scheduled sorting order 6 can be adjusted to the time period (10:00-10:30) corresponding to the third order queue 330 for sorting, so it can be determined that the number of orders in the third order queue 330 has reached the threshold number at this time. Furthermore, since the number of orders in the third order queue 330 has reached the threshold number, the scheduled sorting order 3 and the scheduled sorting order 4 can be adjusted to the time period (9:30-10:00) corresponding to the second order queue 320 for sorting, so it can be determined that the number of orders in the second order queue 320 has also reached the threshold number at this time. In this case, the scheduled sorting order 1 and the scheduled sorting order 2 can be adjusted to the time period (9:00-9:30) corresponding to the first order queue 310 for sorting.

[0052] Continue to refer to Figure 4 The example process of order counting is explained.

[0053] Figure 4 4 is a flowchart showing a process 400 of order counting according to some embodiments of the present disclosure. The process 400 may be implemented at the terminal device 110. For ease of discussion, reference will be made to Figure 1 The process 400 is described with reference to the environment 100 of FIG.

[0054] like Figure 4 As shown, the terminal device 110 can calculate the number of orders of a group of orders that are scheduled for sorting within each time period by a fixed counting method. In some examples, each time period can be determined based on the counting duration and the counting start time, for example: 08:00-08:29, 08:30-08:59, 09:00-09:29, 09:30-09:59. In some examples, the counting duration and the threshold number of each time period can be dynamically configured by the configuration center.

[0055] Specifically, if a new appointment sorting order T is added to a certain time period, the number of original orders is increased by 1 accordingly to obtain the number of new orders. Then, the number of new orders can be compared with the threshold number of the time period. If the number of new orders is greater than the threshold number of the time period, the new appointment sorting order is adjusted to the previous time period of the time period, and it is determined whether the number of orders after the new appointment sorting order T is adjusted to the previous time period exceeds the threshold number of the previous time period. If the number of orders after adjusting to the previous time period does not exceed the threshold number of the previous time period, the new appointment sorting order T is adjusted to the previous time period for sorting. If the number of orders that are scheduled to be sorted after adjusting to the previous time period exceeds the threshold number of the previous time period, the new appointment sorting order T continues to be adjusted to the previous time period for sorting until the number of orders that are scheduled to be sorted in the time period after the new appointment sorting order T is adjusted is less than the corresponding threshold number or reaches the initial time period.

[0056] In summary, the embodiments of the present disclosure can dynamically adjust and assign target orders to appropriate sorting time periods for sorting. In this way, the sorting efficiency can be improved, the number of orders in each time period can be increased, and the user experience can be improved.

[0057] Figure 5 1 is a flowchart of a process 500 for order sorting according to some embodiments of the present disclosure. The process 500 may be implemented at the terminal device 110. For ease of discussion, reference will be made to Figure 1 The process 500 is described with reference to the environment 100 of FIG.

[0058] In block 510 , the terminal device 110 determines the order type and the scheduled sorting completion time of the target order to be sorted.

[0059] At block 520 , in response to determining that the order type indicates a scheduled picking order, the terminal device 110 determines a first time period that matches a scheduled picking completion time.

[0060] In box 530, in response to determining that the first number of the first group of orders that have been scheduled for picking within the first time period has reached a first threshold number, the terminal device 110 determines whether the second number of the second group of orders that have been scheduled for picking within a second time period has reached a second threshold number, and the second time period is before the first time period.

[0061] At block 540 , in response to determining that the second number of the second group of orders that have been scheduled for picking within the second time period has not reached the second threshold number, the terminal device 110 performs picking of the target orders within the second time period.

[0062] In some embodiments, the second time period is determined by: determining at least one candidate time period before the first time period; and selecting from the at least one candidate time period a candidate time period that is shortest in duration with the first time period and for which the second number does not reach the second threshold number as the second time period.

[0063] In some embodiments, process 500 also includes: in response to determining that a second number of the second group of orders that have been scheduled for picking within the second time period has reached a second threshold number, determining whether a third number of the third group of orders that have been scheduled for picking within a third time period has reached a third threshold number, the third time period being before the second time period; and in response to determining that the third number of the third group of orders that have been scheduled for picking within the third time period has not reached the third threshold number, performing sorting of the target orders in the third time period.

[0064] In some embodiments, determining a first time period that matches a scheduled sorting completion time includes: determining at least one time period for sorting a target order, the at least one time period including at least one candidate time period; and in response to determining that the scheduled sorting completion time is within a time range indicated by a target time period in the at least one time period, determining the target time period as a first time period that matches the scheduled sorting completion time.

[0065] In some embodiments, determining at least one time period includes: determining the current time and counting duration in response to the start of a timer task for calculating the number of orders to be sorted in at least one time period; determining the counting start time corresponding to the current time based on the first numerical value corresponding to the hour digit of the current time and the counting duration; and determining at least one time period based on the counting start time and the counting duration.

[0066] In some embodiments, determining the counting start time includes: determining a second numerical value corresponding to the minute digit of the current time; determining a multiple based on the second numerical value and the counting duration; determining the product of the multiple and the counting duration; and determining the counting start time based on the sum of the first numerical value and the product.

[0067] The embodiments of the present disclosure also provide corresponding devices for implementing the above methods or processes.

[0068] Figure 6 A schematic structural block diagram of an apparatus 600 for order sorting according to some embodiments of the present disclosure is shown. The apparatus 600 may be implemented as or included in a terminal device 110. Each module / component in the apparatus 600 may be implemented by hardware, software, firmware, or any combination thereof.

[0069] like Figure 6As shown, the device 600 includes a determination module 610, which is configured to determine the order type and the scheduled sorting completion time of the target order to be sorted. The device 600 also includes a matching module 620, which is configured to determine a first time period that matches the scheduled sorting completion time in response to determining that the order type indicates a scheduled sorting order. The device 600 also includes an execution module 630, which is configured to determine whether the second number of the second group of orders that have been scheduled for sorting in the first time period has reached a first threshold number in response to determining that the first number of the first group of orders that have been scheduled for sorting in the first time period has reached a first threshold number, and the second time period is before the first time period. The device 600 also includes a sorting module 640, which is configured to perform sorting of the target order in the second time period in response to determining that the second number of the second group of orders that have been scheduled for sorting in the second time period has not reached the second threshold number.

[0070] In some embodiments, the second time period is determined by: determining at least one candidate time period before the first time period; and selecting from the at least one candidate time period a candidate time period that is shortest in duration with the first time period and for which the second number does not reach the second threshold number as the second time period.

[0071] In some embodiments, the device 600 also includes a first sorting module, which is configured to determine whether a third number of a third group of orders that have been scheduled for picking in a third time period has reached a third threshold number in response to determining that the second number of the second group of orders that have been scheduled for picking in the second time period has reached a second threshold number, and the third time period is before the second time period; and in response to determining that the third number of the third group of orders that have been scheduled for picking in the third time period has not reached the third threshold number, perform sorting on the target orders in the third time period.

[0072] In some embodiments, the matching module 620 is further configured to determine at least one time period for sorting a target order, the at least one time period including at least one candidate time period; and in response to determining that the scheduled sorting completion time is within the time range indicated by the target time period in the at least one time period, determine the target time period as a first time period that matches the scheduled sorting completion time.

[0073] In some embodiments, the matching module 620 is also configured to determine the current time and counting duration in response to the start of a timed task for calculating the number of orders to be sorted in at least one time period; determine the counting start time corresponding to the current time based on the first numerical value corresponding to the hour digit of the current time and the counting duration; and determine at least one time period based on the counting start time and the counting duration.

[0074] In some embodiments, the matching module 620 is also configured to determine a second numerical value corresponding to the minute digit of the current moment; determine a multiple based on the second numerical value and the counting duration; determine the product of the multiple and the counting duration; and determine the counting start time based on the sum of the first numerical value and the product.

[0075] The units and / or modules included in the device 600 can be implemented in various ways, including software, hardware, firmware, or any combination thereof. In some embodiments, one or more units and / or modules can be implemented using software and / or firmware, such as machine executable instructions stored on a storage medium. In addition to or as an alternative to machine executable instructions, some or all of the units and / or modules in the device 600 can be implemented at least in part by one or more hardware logic components. As an example and not limitation, exemplary types of hardware logic components that can be used include field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0076] It should be understood that one or more steps in the above method can be performed by a suitable electronic device or a combination of electronic devices. Such an electronic device or a combination of electronic devices may include, for example, Figure 1 The terminal device 110 in.

[0077] Figure 7 1 shows a block diagram of an electronic device 700 in which one or more embodiments of the present disclosure may be implemented. It should be understood that Figure 7 The electronic device 700 shown is merely exemplary and should not constitute any limitation on the functionality and scope of the embodiments described herein. Figure 7 The electronic device 700 shown can be used to implement Figure 1 The terminal device 110 or Figure 6 Device 600.

[0078] like Figure 7 As shown, the electronic device 700 is in the form of a general electronic device. The components of the electronic device 700 may include, but are not limited to, one or more processors or processing units 710, a memory 720, a storage device 730, one or more communication units 740, one or more input devices 750, and one or more output devices 760. The processing unit 710 may be an actual or virtual processor and is capable of performing various processes according to a program stored in the memory 720. In a multi-processor system, multiple processing units execute computer executable instructions in parallel to improve the parallel processing capability of the electronic device 700.

[0079] The electronic device 700 typically includes a plurality of computer storage media. Such media can be any available media accessible to the electronic device 700, including but not limited to volatile and non-volatile media, removable and non-removable media. The memory 720 can be a volatile memory (e.g., register, cache, random access memory (RAM)), a non-volatile memory (e.g., read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory) or some combination thereof. The storage device 730 can be a removable or non-removable medium, and can include a machine-readable medium, such as a flash drive, a disk, or any other medium, which can be used to store information and / or data and can be accessed within the electronic device 700.

[0080] The electronic device 700 may further include additional removable / non-removable, volatile / non-volatile storage media. Figure 7 As shown in , a disk drive for reading or writing from a removable, non-volatile disk (e.g., a "floppy disk") and an optical drive for reading or writing from a removable, non-volatile optical disk may be provided. In these cases, each drive may be connected to the bus (not shown) by one or more data media interfaces. The memory 720 may include a computer program product 725 having one or more program modules that are configured to perform various methods or actions of various embodiments of the present disclosure.

[0081] The communication unit 740 implements communication with other electronic devices through a communication medium. Additionally, the functions of the components of the electronic device 700 can be implemented with a single computing cluster or multiple computing machines that can communicate through a communication connection. Therefore, the electronic device 700 can operate in a networked environment using a logical connection with one or more other servers, a network personal computer (PC), or another network node.

[0082] The input device 750 may be one or more input devices, such as a mouse, a keyboard, a tracking ball, etc. The output device 760 may be one or more output devices, such as a display, a speaker, a printer, etc. The electronic device 700 may also communicate with one or more external devices (not shown) through the communication unit 740 as needed, such as a storage device, a display device, etc., communicate with one or more devices that allow a user to interact with the electronic device 700, or communicate with any device that allows the electronic device 700 to communicate with one or more other electronic devices (e.g., a network card, a modem, etc.). Such communication may be performed via an input / output (I / O) interface (not shown).

[0083] According to an exemplary implementation of the present disclosure, a computer-readable storage medium is provided, on which computer-executable instructions are stored, wherein the computer-executable instructions are executed by a processor to implement the method described above. According to an exemplary implementation of the present disclosure, a computer program product is also provided, which is tangibly stored on a non-transitory computer-readable medium and includes computer-executable instructions, and the computer-executable instructions are executed by a processor to implement the method described above.

[0084] Various aspects of the present disclosure are described herein with reference to the flowcharts and / or block diagrams of the methods, devices, equipment, and computer program products implemented according to the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer-readable program instructions.

[0085] These computer-readable program instructions can be provided to a processing unit of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processing unit of the computer or other programmable data processing device, a device that implements the functions / actions specified in one or more boxes in the flowchart and / or block diagram is generated. These computer-readable program instructions can also be stored in a computer-readable storage medium, and these instructions cause the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable medium storing the instructions includes a manufactured product, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0086] Computer-readable program instructions can be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operational steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, so that the instructions executed on the computer, other programmable data processing apparatus, or other device implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0087] The flow chart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to multiple implementations of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and a part of a module, program segment or instruction includes one or more executable instructions for realizing the logical function of the specification. In some implementations as replacements, the function marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two continuous square boxes can actually be executed substantially in parallel, and they can sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be realized by a special hardware-based system that performs the function or action of the specification, or can be realized by a combination of special hardware and computer instructions.

[0088] The above descriptions of various implementations of the present disclosure are exemplary, non-exhaustive, and not limited to the disclosed implementations. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described implementations. The selection of terms used herein is intended to best explain the principles of the implementations, practical applications, or improvements to the technology in the market, or to enable other persons of ordinary skill in the art to understand the various implementations disclosed herein.

Claims

1. A method for order sorting, comprising: Determine the order type and scheduled sorting completion time of the target order to be sorted; In response to determining that the order type indicates a scheduled sorting order, determining a first time period that matches the scheduled sorting completion time; In response to determining that a first number of the first group of orders that have been scheduled for picking within the first time period has reached a first threshold number, determining whether a second number of the second group of orders that have been scheduled for picking within a second time period has reached a second threshold number, the second time period being before the first time period; as well as In response to determining that the second number of the second group of orders that have been scheduled for picking within the second time period has not reached the second threshold number, picking of the target orders is performed within the second time period.

2. The method according to claim 1, wherein the second time period is determined in the following manner: determining at least one candidate time period before the first time period; and A candidate time period which is the shortest in time distance from the first time period and for which the second number does not reach the second threshold number is selected from the at least one candidate time period as the second time period.

3. The method according to claim 1, further comprising: In response to determining that the second number of the second group of orders that have been scheduled for picking within the second time period has reached the second threshold number, determining whether a third number of the third group of orders that have been scheduled for picking within a third time period has reached a third threshold number, the third time period being before the second time period; and In response to determining that the third number of the third group of orders that have been scheduled for picking within the third time period has not reached the third threshold number, picking is performed on the target order within the third time period.

4. The method of claim 1 , wherein determining the first time period matching the predetermined sorting completion time comprises: Determining at least one time period for sorting the target order, wherein the at least one time period includes at least one candidate time period; as well as In response to determining that the scheduled sorting completion time is within a time range indicated by a target time period in the at least one time period, the target time period is determined to be the first time period that matches the scheduled sorting completion time.

5. The method of claim 4, wherein determining the at least one time period comprises: In response to the start of a timer task for calculating the number of orders to be sorted in the at least one time period, determining a current time and a counting duration; Determine the counting start time corresponding to the current time based on the first value corresponding to the hour digit of the current time and the counting duration; and The at least one time period is determined based on the counting start time and the counting duration.

6. The method according to claim 5, wherein determining the counting start time comprises: Determine a second numerical value corresponding to the minute digit of the current moment; Determine a multiple based on the second value and the counting time; Determine the product of the multiple and the counting time length; as well as The counting start time is determined based on the sum of the first value and the product.

7. A device for order sorting, comprising: A determination module, configured to determine an order type and a scheduled sorting completion time of a target order to be sorted; A matching module configured to determine a first time period that matches the scheduled sorting completion time in response to determining that the order type indicates a scheduled sorting order; an execution module configured to, in response to determining that a first number of the first group of orders that have been scheduled for picking within the first time period has reached a first threshold number, determine whether a second number of the second group of orders that have been scheduled for picking within a second time period has reached a second threshold number, the second time period being before the first time period; as well as The sorting module is configured to perform sorting of the target order in the second time period in response to determining that the second number of the second group of orders that have been scheduled for sorting in the second time period does not reach the second threshold number.

8. An electronic device, comprising: at least one processing unit; as well as At least one memory, the at least one memory is coupled to the at least one processing unit and stores instructions for execution by the at least one processing unit, the instructions, when executed by the at least one processing unit, causing the electronic device to perform the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, wherein the computer program can be executed by a processor to implement the method according to any one of claims 1 to 6.

10. A computer program product comprising computer executable instructions, wherein the computer executable instructions, when executed by a processor, implement the method according to any one of claims 1 to 6.