Dynamic order scheduling algorithm based on band threshold

Abstract

The invention discloses a dynamic order scheduling algorithm based on a belt threshold value, and the algorithm comprises the steps: enabling goods to enter a storage space, arriving at a purchase station, carrying out the classification of the goods through RFID goods information, and transferring the classified goods to a corresponding purchase temporary storage region through a conveying belt; when the AGV is idle and it is detected that the goods are to be warehoused in the incoming goods temporary storage area, the goods are taken and transferred to a stacking machine in the storage area, and the stacking machine stores the goods to proper goods shelf positions and then completes warehousing; and when a shipment order demand exists, the automatic stacker sorts the goods from the goods sorting area based on a dynamic order scheduling algorithm with a threshold value, transfers the goods to the packaging area through the transfer area for packaging, and then transfers the goods to the shipment temporary storage area to prepare for shipment. According to the method, a dynamic order scheduling algorithm with a threshold value is combined, on the basis of ensuring that goods taking is completed, the order integrity is improved, the goods taking time is shortened, meanwhile, the route of each step is planned, and the storage efficiency is improved.

Description

Technical Field

[0001] The present invention relates to the field of logistics technology, and particularly to a dynamic order scheduling algorithm based on a threshold. Background Art

[0002] For dynamic order scheduling, the background art of the algorithm needs to cover knowledge in the field of dynamic order scheduling. This includes handling order reception, scheduling, execution, and monitoring. It is important to understand the general problems of order scheduling, such as concepts and challenges in task assignment, resource utilization, task priority, etc.

[0003] Scheduling algorithms, common scheduling algorithms such as First-Come-First-Served (FCFS), Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, Round Robin Scheduling, etc. These algorithms can provide references for designing a dynamic order scheduling algorithm with a threshold.

[0004] Dynamic environment, in dynamic order scheduling, the environment often changes. It is necessary to understand the types and frequencies of environmental changes, such as the arrival of new orders, task cancellations, resource failures, etc. This helps to determine when to adjust scheduling decisions.

[0005] The existing warehousing scheduling algorithms mainly have the following problems: Firstly, complexity and scale problems. The warehousing environment can be very complex, including a large number of goods, different types of warehouses, various equipment and resources. Handling the scheduling problems of large-scale warehousing systems usually requires highly optimized algorithms and computing power. Secondly, many warehousing systems are dynamic, and orders and demands may change at any time. Traditional static scheduling algorithms are difficult to cope with dynamic environments, and more flexible algorithms are needed to adapt to changes. Some warehousing scenarios have extremely high real-time requirements and need to respond immediately to new orders and emergency tasks. Traditional algorithms are difficult to meet such real-time requirements, and the warehousing system needs to be scalable to adapt to the increasing quantity of goods and demands. Finally, the items in the same order are distributed on different shelves, and the current algorithms cannot schedule the items as a whole order. Summary of the Invention

[0006] The purpose of this part is to outline some aspects of the embodiments of the present invention and briefly introduce some preferred embodiments. Some simplifications or omissions may be made in this part, as well as in the abstract and title of the present application, to avoid obscuring the purpose of this part, the abstract, and the title. However, such simplifications or omissions cannot be used to limit the scope of the present invention.

[0007] In view of the above existing problems, the present invention is proposed.

[0008] Therefore, the technical problem to be solved by the present invention is that the existing warehousing scheduling algorithms have reduced efficiency when dealing with more complex and larger-scale warehousing environments, and there is no problem of scheduling goods by regarding an order as a whole.

[0009] To solve the above technical problems, the present invention provides the following technical solution: A dynamic order scheduling algorithm based on a threshold, including: Goods enter the warehousing space and reach the inbound platform. After obtaining the goods information through RFID, the goods are classified, and the classified goods are transferred to the corresponding inbound temporary storage area through a conveyor belt. When the AGV is idle and detects that there are goods in the inbound temporary storage area waiting to be warehoused, it arrives at the inbound temporary storage area to pick up the goods, transfers the goods to the stacker in the corresponding storage area, and the stacker stores the goods in a suitable shelf position, and the goods warehousing is completed. When there is a demand for an outbound order, the automatic stacker selects and retrieves the ordered items from the shelves in the picking area based on the dynamic order scheduling algorithm with a threshold. The retrieved items are placed at the transfer station in the transfer area. An AGV fleet is used to transport the items from the transfer area to the packaging area for packing, and then transferred to the outbound temporary storage area for preparation for outbound. At the same time, it is judged whether replenishment is required after the order is shipped. If replenishment is required, the goods are replenished from the storage area to the picking area, and the goods are displayed by piece in the picking area.

[0010] As a preferred solution of the dynamic order scheduling algorithm with a threshold according to the present invention, wherein: the goods information includes the production date, the type of goods, and the number of single items included in each box of goods, and all goods information is included in the RFID tag of the goods; Goods enter the warehousing space and reach the inbound platform. The RFID reader reads the goods in sequence. After reading, the goods are classified according to the type of goods, and different types of goods are transferred to their respective inbound temporary storage areas through different conveyor belts. The inbound temporary storage area is partitioned according to the types of goods stored. The same type of goods is generally stored in the same inbound temporary storage area. If the types and quantities of goods are unbalanced, the goods type with a larger quantity can occupy multiple inbound temporary storage areas; The storage area is classified and partitioned for storage. The same type of goods is stored in the same storage area. The inbound temporary storage area and the storage area generally correspond one by one. The AGV fleet is responsible for picking up goods from the inbound temporary storage area to the storage area. When the AGV is idle, it detects whether there are goods in the inbound temporary storage area waiting to be warehoused. If there are, after picking up the goods from the inbound temporary storage area of a certain type of goods, they are sent to the nearest corresponding storage area. When picking up the goods, the principle of first in first out is followed, and the goods sent first are warehoused first.

[0011] As a preferred embodiment of the dynamic order scheduling algorithm with thresholds according to the present invention, the storage area has a single-rail and single-stacker structure, where each shelf is associated with a stacker. The shelves can be divided into multiple layers vertically, and each layer space is further divided into several storage units horizontally. Only one type of goods can be stored in one storage unit. After the stacker completes an outbound task, it checks whether there are goods waiting to be stored in the corresponding inbound temporary storage area. If there are, the stacker moves to the inbound port to pick up the goods and retrieves a suitable storage unit to store them. After the stacker completes an inbound task, it checks whether there is a demand for replenishing goods from this shelf. If there is, it retrieves the goods that were stored earliest in this shelf according to the first-in, first-out algorithm. The stacker moves from the end position of the inbound operation to this storage unit to pick up the goods, and after picking up the goods, transfers them to the transfer area for replenishment. By calculating the total time required for the stacker to perform a pick-up operation for replenishment from point (x, y), the common retrieval time function can be obtained, which is expressed as:

[0012] In the formula, is the height of each layer of the shelf, is the width of each storage unit, is the horizontal moving speed of the stacker, is the vertical moving speed of the stacker, is the sum of the constant number of times required for the stacker to take out items, is the travel time of the stacker from (0,0) to (x, y), which is the maximum travel time in two directions.

[0013] As a preferred embodiment of the dynamic order scheduling algorithm with thresholds according to the present invention, the picking area serves as the first-level warehouse to meet customer order requirements. When a new customer order is received, the scheduling order is solved again through the dynamic order scheduling algorithm with thresholds, and items in the current order are preferentially picked from the picking area, while the storage area is used as the second-level backup warehouse to meet replenishment needs. The picking area is a small warehouse, similar in structure to the storage area. Goods are classified and stored by piece. Items ordered by the same customer are regarded as an indivisible part, and can only be packed into a package when all items in the order are taken out. Items in the same customer order may be distributed on different shelves due to different types. For the integrity of the order sequence, order labels are used to mark all goods belonging to the same order, and the order retrieval task is completed according to the dynamic order scheduling algorithm with thresholds. As a preferred embodiment of the dynamic order scheduling algorithm with a threshold according to the present invention, wherein: the steps of solving based on the dynamic order scheduling algorithm with a threshold include: Step 1: The scheduler continuously detects whether new orders arrive; Step 2: Set a dynamic time , taking as a time period, add the items in all orders received within time to the order , and update the value of , where is the set of orders waiting for jobs in the queue, and is the order number; Step 3: Assume is 10 seconds, and 100 new orders arrive within 10 seconds; Step 4: The items required in these 100 orders will be scanned and mapped to the job queues of the corresponding stackers, and the scheduler updates the values of and accordingly; Step 5: The scheduler initializes the running variables of the order tags during calculation or recalculation; Step 6: The scheduler calls the order tag calculation or recalculation, and the jobs in are arranged according to the calculated priorities; Step 7: Arrange each stacker in ascending order of the item order tags to retrieve the items; Step 8: Each stacker retrieves the items in the orders within 10 seconds according to the scheduling order of the scheduler, and takes out the items of the same type in the orders within 10 seconds at the same time; Step 9: When the stacker retrieves the items in the orders within every 10 seconds, the scheduler will update the values of and , in addition, the scheduler will also check whether the corresponding order is completed. If it is completed, the completed order will be deleted from the set of uncompleted orders; Step 10: If a certain job has not started to be retrieved within the set threshold , then increase its priority; Step 11: If is not empty, the stacker continues the retrieval process.

[0014] As a preferred embodiment of the dynamic order scheduling algorithm with a threshold according to the present invention, wherein: the value of the dynamic time in the dynamic order scheduling algorithm with a threshold changes dynamically according to the order volume. When the order volume increases, the duration of is correspondingly shortened, and when the order volume decreases, it is correspondingly increased The duration of varies dynamically in real time according to the order volume; The duration of the dynamic time cannot exceed a set threshold, expressed as: , In the formula, is the duration of the dynamic time, is the set threshold; If in the case of extremely low order volume, increases to the threshold , the program will be immediately mobilized for retrieval; The said threshold is currently set to 1 minute, and its value can be changed according to specific circumstances.

[0015] As a preferred embodiment of the dynamic order scheduling algorithm with a threshold according to the present invention, wherein: the items taken out from the picking area are transported to the packaging area through the transfer area for packing. The items in the same customer order may be of different types and need to be transported to the same packaging area for packing; The transfer area is a three - level circulation area. All items taken out from the picking area will be placed on the circulating conveyor belt in the first - level area for machine and manual verification of whether the products are qualified. If qualified, they will be transferred to the conveyor belt in the second - level area to circulate and wait for other items in the same order. Otherwise, the unqualified products will be taken out and marked in the system, and a new pick - up requirement will be applied. When all items in the same order have been inspected and qualified and transferred to the second - level conveyor belt, the items on the second - level conveyor belt will be continuously and circularly detected to check whether all items in the same order have been collected. If collected, they can be sequentially transferred to the conveyor belt in the third - level area to reach the packaging area for packing. In this process, the first - in - first - out strategy is adopted, and the order that is assembled first is transferred to the third - level area for packing first. If not collected, they will continue to circulate and wait; The three - level circulation area of the transfer area is divided into multiple conveyor belts. The items in the same order are transferred to the same conveyor belt for easy packing and to prevent confusion with items in other orders; A switch is set in the three - level conveyor belt to prevent items in multiple orders from arriving at the packaging area simultaneously. After the items in the current order are packed, the collected items in another order will be released and transferred to the packaging area, and so on.

[0016] As a preferred embodiment of the dynamic order scheduling algorithm with a threshold according to the present invention, wherein: all items in the three - level circulation area must be verified before being transferred to the next area, expressed as: , In the formula, is the order in the Verification result of an item (1 for qualified and 0 for unqualified); Using the first-in, first-out strategy, the collected orders are preferentially transferred to the packaging area. When all items of an order are collected, the items of the order can be transferred to the packaging area, expressed as: , In the formula, is to transfer the items of order to the circulation area , is the packaging area; The switch state of the conveyor belt, expressed as 1 and 0, is 1 when an item arrives and 0 when no item arrives; The operation process of the three-level circulation area is as follows: Place the items taken out from the picking area on the conveyor belt in the first-level circulation area for verification, expressed as: , In the formula, is the picking area, is to transfer the items of order to the circulation area C_k; The items with qualified verification are transferred to the second-level circulation area and wait for other items of the same order, expressed as: , In the formula, is to transfer the items of order to the circulation area , is the first-level circulation area, is the second-level circulation area; When all items of an order are collected in the second-level circulation area, these items are transferred to the third-level circulation area, expressed as , In the formula, is to transfer the items of order to the circulation area C_k, is the second-level circulation area, is the third-level circulation area; When the switch state of the third-level circulation area permits, the items in the order are transferred to the packaging area for packing, expressed as: , In the formula, is to transfer the items of order to the circulation area is the switch state of the conveyor belt in the third-level circulation area (1 when an item arrives and 0 when no item arrives), It is a three - level circulation area, and it is a packaging area.

[0017] A computer device includes a memory and a processor. The memory stores a computer program, and the processor executes the steps of the above - mentioned method.

[0018] A computer - readable storage medium stores a computer program thereon. When the computer program is executed by a processor, it implements the steps of the above - mentioned method.

[0019] Advantages of the present invention: The present invention combines a dynamic order scheduling algorithm with a threshold, takes an order as a whole, tries to maintain the integrity of the order, classifies and picks up goods through this algorithm to obtain the optimal sequence of picking up goods. On the basis of ensuring the completion of picking up goods, it improves the integrity of the order, reduces the time of picking up goods, and at the same time plans the route for each step, thus enhancing the efficiency of the warehouse. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following - described drawings are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings. Among them: Figure 1 FIG. is an overall flowchart of a dynamic order scheduling algorithm based on a threshold provided by the first embodiment of the present invention.

[0021] Figure 2 FIG. is a warehouse area diagram of a dynamic order scheduling algorithm based on a threshold provided by the first embodiment of the present invention.

[0022] Figure 3 FIG. is an algorithm flowchart of a dynamic order scheduling algorithm based on a threshold provided by the first embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0023] In order to make the above - mentioned objects, features and advantages of the present invention more obvious and understandable, the following will make a detailed description of the specific embodiments of the present invention in conjunction with the drawings of the specification. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0024] In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, the present invention may be practiced in other ways than those specifically described herein. Those skilled in the art can make similar extensions without departing from the spirit of the present invention. Therefore, the present invention is not limited by the specific embodiments disclosed below.

[0025] Secondly, the so-called "one embodiment" or "embodiment" herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The appearances of "in one embodiment" in different places in this specification do not all refer to the same embodiment, nor are they separate or alternative embodiments that exclude each other.

[0026] The present invention is described in detail in conjunction with schematic diagrams. When describing the embodiments of the present invention in detail, for the convenience of explanation, the cross-sectional views showing the device structure will be enlarged locally out of the general scale, and the schematic diagrams are only examples and should not limit the scope of protection of the present invention herein. In addition, in actual production, three-dimensional spatial dimensions including length, width, and depth should be included.

[0027] At the same time, in the description of the present invention, it should be noted that the orientation or positional relationship indicated by terms such as "upper, lower, inner, and outer" is based on the orientation or positional relationship shown in the drawings. It is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation to the present invention. In addition, the terms "first, second, or third" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance.

[0028] Unless otherwise clearly defined and limited in the present invention, the terms "installation, connection, and coupling" should be understood in a broad sense. For example, it can be a fixed connection, a detachable connection, or an integral connection; it can also be a mechanical connection, an electrical connection, or a direct connection, and can also be indirectly connected through an intermediate medium, or can be the communication inside two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific situations.

[0029] Embodiment 1: Referring to Figures 1-3 , for an embodiment of the present invention, a dynamic order scheduling algorithm with a threshold is provided, including: S1: Goods enter the storage space and reach the receiving platform. After obtaining the goods information through RFID, the goods are classified, and the classified goods are transferred to the corresponding receiving temporary storage area through a conveyor belt; When the AGV is idle and detects that there are goods in the receiving temporary storage area waiting to be warehoused, it reaches the receiving temporary storage area to pick up the goods, transfers the goods to the stacker in the corresponding storage area, and the stacker stores the goods in a suitable shelf position, and the goods warehousing is completed.

[0030] S2: When there is a demand for shipping orders, the automatic stacker selects and retrieves the ordered items from the picking area shelves based on a dynamic order scheduling algorithm with thresholds. The retrieved items are placed at the transfer station in the transfer area. An AGV fleet is used to transport the items from the transfer area to the packaging area for packing, and then transferred to the shipping staging area, ready for outbound shipment. At the same time, it is judged whether replenishment is required after the order is shipped. If replenishment is required, after replenishing the goods from the storage area to the picking area, the goods are displayed by piece in the picking area.

[0031] S3: The goods information includes the production date, the type of goods, and the number of single pieces included in each box of goods. All goods information is included in the RFID tag of the goods; When the goods enter the storage space and reach the inbound platform, the RFID reader reads the goods in sequence. After reading, the goods are classified according to the type of goods. Different types of goods are transferred to their respective inbound staging areas through different conveyor belts.

[0032] S4: The inbound staging area is partitioned according to the categories of the stored goods. The same type of goods is generally stored in the same inbound staging area. If the types and quantities of the goods are unbalanced, the goods type with a larger quantity can occupy multiple inbound staging areas.

[0033] S5: The storage area is classified and partitioned for storage. The same type of goods is stored in the same storage area. The inbound staging area and the storage area generally correspond one by one. The AGV fleet is responsible for fetching goods from the inbound staging area to the storage area. When the AGV is idle, it detects whether there are goods waiting to be warehoused in the inbound staging area. If there are, after fetching the goods from the inbound staging area of a certain type of goods, they are sent to the nearest corresponding storage area. When fetching goods, follow the first-in, first-out principle, and the goods sent first are warehoused first.

[0034] S6: The storage area has a single-rail and single-stacker structure. Each shelf is associated with a stacker. The shelf can be divided into multiple layers in the vertical direction, and each layer of space is further divided into several storage units in the horizontal direction. Only one type of goods can be stored in one storage unit; After the stacker completes an outbound task, it detects whether there are goods waiting to be warehoused in the corresponding inbound staging area. If there are, the stacker moves to the inbound port to pick up the goods and retrieves a suitable storage unit to store the goods; After the stacker completes an inbound task, it detects whether there is a demand for replenishing and shipping goods from this shelf. If there is, according to the first-in, first-out algorithm, the goods that were warehoused earliest in this shelf are retrieved. The stacker moves from the end position of the inbound operation to this storage unit to pick up the goods, and after picking up the goods, transfers the goods to the transfer area for replenishment; By calculating the total time required for the stacker to perform a picking operation for replenishment from point (x, y), the common retrieval time function can be obtained, which is expressed as:

[0035] Wherein, is the height of each layer of the shelf, is the width of each storage unit, is the horizontal moving speed of the stacker, is the vertical moving speed of the stacker, is the sum of the constant number of times required for the stacker to pick up items, is the travel time of the stacker from (0, 0) to (x, y), which is the maximum travel time in two directions.

[0036] S7: The picking area serves as the first-level warehouse to meet the customer order requirements. When a new customer order is received, the scheduling order is solved again through the dynamic order scheduling algorithm with a threshold, and the items in the current order are preferentially picked from the picking area, while the storage area is used as the second-level backup warehouse to meet the replenishment requirements; The picking area is a small warehouse, similar in structure to the storage area. The goods are classified and stored by piece. The items ordered by the same customer are regarded as an indivisible part and can be packed into a package only when all the items in the order are taken out; The items in the same customer order may be distributed on different shelves due to different types. For the integrity of the order sequence, order labels are used to mark all the goods belonging to the same order, and the order retrieval task is completed according to the dynamic order scheduling algorithm with a threshold.

[0037] S8: The steps for solving based on the dynamic order scheduling algorithm with a threshold include: Step 1: The scheduler continuously detects whether a new order arrives; Step 2: Set a dynamic time , taking as a time period, add the items in all the orders received within time to the order , and update the value, where is the set of orders waiting for jobs in the queue, is the order number; Step 3: Assume is 10 seconds, and 100 new orders arrive within 10 seconds; Step 4: The items required in these 100 orders will be scanned and mapped into the job queue of the corresponding stacker, and the scheduler updates the and values accordingly; Step 5: The scheduler initializes the running variables of the order label during the calculation or recalculation process; Step 6: The scheduler calls for the calculation or recalculation of order labels, and the jobs in are arranged according to the calculated priorities; Step 7: Each stacker crane is arranged in ascending order of item order labels to retrieve items; Step 8: Each stacker crane retrieves the items in the order within 10 seconds according to the scheduling order of the scheduler, and takes out the items of the same type in the order within 10 seconds at the same time; and When the stacker crane retrieves the items in the order within every 10 seconds, the scheduler will update and values. In addition, the scheduler will also check whether the corresponding order is completed. If it is completed, the completed order will be deleted from the set of uncompleted orders; Step 10: If a certain job has not started retrieval within the set threshold , then its priority is increased;

[0038] S9: The value of the dynamic time changes dynamically according to the order volume. When the order volume increases, the duration of is correspondingly shortened, and when the order volume decreases, the duration of is correspondingly increased. The value of changes dynamically in real time according to the order volume; , wherein, is the duration of the dynamic time, is the set threshold; If in the case of extremely low order volume, increases to the threshold , the program will be immediately mobilized for retrieval; The said threshold is currently set to 1 minute, and its value can be changed according to specific circumstances.

[0039] S10: The items retrieved from the picking area are transported to the packaging area through the transfer area for packing. The items in the same customer order may be of different types and need to be transported to the same packaging area for packing; The transfer area is a three - level circulation area. All items taken out from the picking area will be placed on the circulating conveyor belt in the first - level area for machine and manual verification of product qualification. If qualified, they will be transferred to the conveyor belt in the second - level area to circulate and wait for other items in the same order. Otherwise, the unqualified products will be taken out and marked in the system, and a new picking requirement will be applied. When all items in the same order have been inspected and qualified and transferred to the second - level conveyor belt, the items on the second - level conveyor belt will be continuously circulated to detect whether all items in the same order have been collected. If collected, they can be sequentially transferred to the conveyor belt in the third - level area to reach the packaging area for packing. In this process, the first - in - first - out strategy is adopted, and the order that is completed first is transferred to the third - level area for packing first. If not collected, they will continue to circulate and wait.

[0040] S11: The three - level circulation area in the transfer area is divided into multiple conveyor belts. Items in the same order are transferred to the same conveyor belt for easy packing and to prevent confusion with items in other orders. A switch is set in the third - level conveyor belt to prevent items from multiple orders from arriving at the packaging area simultaneously. After the items in the current order are packed, the collected items in another order will be released and transferred to the packaging area, and so on.

[0041] S12: All items in the three - level circulation area must be verified before being transferred to the next area, expressed as: , In the formula, is the verification result (qualified is 1, unqualified is 0) of the th item in order ; Using the first - in - first - out strategy, the collected orders are preferentially transferred to the packaging area. When all items in an order are collected, the items of this order can be transferred to the packaging area, expressed as: , In the formula, is to transfer the items of order to the circulation area , is the packaging area; The switch state of the conveyor belt, expressed as 1 and 0, with items arriving as 1 and no items arriving as 0; The operation process of the three - level circulation area is as follows: Place the items taken out from the picking area on the conveyor belt in the first - level circulation area for verification, expressed as: , In the formula, is the picking area, is to transfer the items of order to the circulation area C_k; The items that pass the verification are transferred to the secondary circulation area and wait for other items of the same order, expressed as: , wherein, is to transfer the items of order to the circulation area , is the primary circulation area, is the secondary circulation area; When all the items of an order are collected in the secondary circulation area, these items are transferred to the tertiary circulation area, expressed as , wherein, is to transfer the items of order to the circulation area C_k, is the secondary circulation area, is the tertiary circulation area; When the switch state of the tertiary circulation area permits, the items in the order are transferred to the packaging area for packing, expressed as: , wherein, is to transfer the items of order to the circulation area is the switch state of the conveyor belt in the tertiary circulation area (1 when there are items arriving, 0 when there are no items arriving), is the tertiary circulation area, is the packaging area.

[0042] The computer device in this embodiment may be a server. The computer device includes a processor, a memory, an input / output interface (Input / Output, abbreviated as I / O), and a communication interface. Among them, the processor, the memory, and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store the data cluster data of the goods scheduling program model. The input / output interface of the computer device is used to exchange information between the processor and external devices. The communication interface of the computer device is used to communicate with external terminals through a network connection. When the computer program is executed by the processor, it implements a dynamic order scheduling algorithm with thresholds.

[0043] In summary, this embodiment combines a dynamic order scheduling algorithm with a threshold, taking into account the integrity of the same order. Through this algorithm, the optimal sequence of picking up goods is obtained by classification. On the basis of ensuring the completion of picking up goods, the integrity of the order is improved, the time for picking up goods is reduced, and the route for each step is planned well, thus enhancing the efficiency of the warehouse.

[0044] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above methods. Among them, any reference to a memory, a database, or other media provided in the various embodiments of the present application can include at least one of non-volatile and volatile memories. Non-volatile memories can include read-only memory (ROM), magnetic tapes, floppy disks, flash memories, optical memories, high-density embedded non-volatile memories, resistive random access memories (ReRAM), magnetoresistive random access memories (MRAM), ferroelectric random access memories (FRAM), phase change memories (PCM), graphene memories, etc. Volatile memories can include random access memory (RAM) or external cache memories, etc. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc. The databases involved in the various embodiments of the present application can include at least one of relational databases and non-relational databases. Non-relational databases can include distributed databases based on blockchain, etc., and are not limited thereto. The processors involved in the various embodiments of the present application can be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, data processing logics based on quantum computing, etc., and are not limited thereto.

[0045] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the present invention can be modified or equivalently replaced without departing from the spirit and scope of the technical solutions of the present invention, and they should all be covered within the scope of the claims of the present invention.

Claims

1. A warehousing scheduling method based on a dynamic order scheduling algorithm with a threshold, characterized in that, It includes the following steps: Goods enter the storage space, reach the inbound platform, are classified after obtaining the goods information through RFID, and the classified goods are transferred to the corresponding inbound temporary storage area through a conveyor belt; When the AGV is idle and detects that there are goods in the inbound temporary storage area waiting to be stored in the warehouse, it reaches the inbound temporary storage area to pick up the goods, transfers the goods to the stacker in the corresponding storage area, and the stacker stores the goods in a suitable shelf position, and the goods are successfully stored in the warehouse; When there is a demand for an outbound order, the automatic stacker selects and retrieves the ordered items from the shelves in the picking area based on a dynamic order scheduling algorithm with a threshold. The retrieved items are placed at the transfer station in the transfer area. An AGV fleet is used to transport the items from the transfer area to the packaging area for packing, and then transferred to the outbound temporary storage area, ready for outbound. At the same time, it is judged whether replenishment is required after the order is shipped. If replenishment is required, the goods are replenished from the storage area to the picking area, and the goods are displayed by piece in the picking area.

2. The warehousing scheduling method based on a dynamic order scheduling algorithm with a threshold as described in claim 1, characterized in that: The goods information includes the production date, the type of goods, and the number of single items included in each box of goods. All goods information is included in the RFID tag of the goods; Goods enter the storage space, reach the inbound platform, and the RFID reader reads the goods in sequence. After reading, the goods are classified according to the type of goods, and different types of goods are transferred to their respective inbound temporary storage areas through different conveyor belts; The inbound temporary storage area is partitioned according to the categories of the stored goods. The same type of goods is stored in the same inbound temporary storage area. If the type and quantity of the goods are unbalanced, the goods type with a larger quantity occupies multiple inbound temporary storage areas; The storage area is classified and partitioned for storage. The same type of goods is stored in the same storage area. The inbound temporary storage area corresponds to the storage area one by one. The AGV fleet is responsible for picking up goods from the inbound temporary storage area to the storage area. When the AGV is idle, it detects whether there are goods in the inbound temporary storage area waiting to be stored in the warehouse. If so, it picks up the goods from the inbound temporary storage area of one type of goods and sends them to the nearest corresponding storage area. When picking up goods, follow the first-in, first-out principle, and the goods delivered first are stored in the warehouse first.

3. A warehousing scheduling method based on a dynamic order scheduling algorithm with thresholds as described in claim 2, characterized in that: The storage area is a single-rail single-stacker structure. Each shelf is associated with a stacker. The shelf is divided into multiple layers in the vertical direction, and each layer of space is divided into several storage units in the horizontal direction. Only one type of goods can be stored in one storage unit; After the stacker completes an outbound task, it detects whether there are goods in the corresponding inbound temporary storage area waiting to be stored in the warehouse. If so, the stacker transfers to the inbound port to pick up the goods and retrieves a suitable storage unit to store the goods; After the stacker completes an inbound task, it detects whether there is a demand for replenishing goods out of the warehouse on this shelf. If so, it retrieves the goods that entered the warehouse earliest on this shelf according to the first-in, first-out algorithm. The stacker moves from the end position of the inbound operation to this storage unit to pick up the goods, and after picking up the goods, transfers the goods to the transfer area for replenishment; By calculating the total time required for the stacker to perform a pick-up operation for replenishment from point (x, y), the common retrieval time function is obtained, which is expressed as: Where h is the height of each layer of the shelf, w is the width of each storage unit, v x is the horizontal moving speed of the stacker, v y is the vertical moving speed of the stacker, T is the sum of the constant number of times required for the stacker to pick up items, is the travel time of the stacker from (0, 0) to (x, y), which is the maximum travel time in two directions.

4. A warehousing scheduling method based on a dynamic order scheduling algorithm with thresholds, as claimed in claim 1, wherein: The picking area serves as the first-level warehouse to meet customer order requirements. When a new customer order is received, the scheduling order is solved again through a dynamic order scheduling algorithm with a threshold, and items in the current order are preferentially picked from the picking area. The storage area is used as the second-level backup warehouse to meet replenishment needs; The picking area is a small warehouse where goods are classified and stored by piece. Items ordered by the same customer are regarded as an indivisible part and can only be packed into a single package when all items in the order are taken out; When items in the same customer order are distributed on different shelves due to different types, in order to ensure the integrity of the order sequence, order labels are used to mark all goods belonging to the same order, and the order retrieval task is completed according to the dynamic order scheduling algorithm with a threshold.

5. The warehousing scheduling method based on a dynamic order scheduling algorithm with a threshold as claimed in claim 4, wherein: The steps for solving based on the dynamic order scheduling algorithm with a threshold include: Step 1: The scheduler continuously detects whether a new order arrives; Step 2: Set a dynamic time t. Taking t as a time period, add the items in all orders received within t time to the order O, and update the value of O_i, where O is the set of orders waiting for jobs in the queue, and O_i is the order number; Step 3: Assume t is 10 seconds, and 100 new orders arrive within 10 seconds; Step 4: The items required in these 100 orders will be scanned and mapped to the job queue of the corresponding stacker, and the scheduler updates the values of O and O_i accordingly; Step 5: The scheduler initializes the running variables of the order label during the calculation or recalculation process; Step 6: The scheduler calls the order label calculation or recalculation, and the jobs in O are arranged according to the calculated priorities; Step 7: Arrange each stacker in ascending order of the item order label to retrieve items; Step 8: Each stacker retrieves the items in the order within 10 seconds according to the scheduling order of the scheduler, and takes out the items of the same type in the order within 10 seconds at the same time; Step 9: When the stacker retrieves the items in the order within every 10 seconds, the scheduler will update the values of O and O_i. In addition, the scheduler will also check whether the corresponding order is completed. If it is completed, the completed order will be deleted from the set of uncompleted orders; Step 10: If a certain job still has not started to be retrieved within the set threshold T, then increase its priority; Step 11: If O is not empty, the stacker continues the retrieval process.

6. The warehousing scheduling method based on a dynamic order scheduling algorithm with thresholds as described in claim 5, characterized in that: In the dynamic order scheduling algorithm with a threshold, the value of the dynamic time t changes dynamically according to the order volume. When the order volume increases, the duration of t is correspondingly shortened, and when the order volume decreases, the duration of t is correspondingly increased. The value of t changes dynamically in real time according to the order volume; The duration of the dynamic time cannot exceed a set threshold, expressed as: t ≤ T, where t is the duration of the dynamic time and T is the set threshold; If in the case of a small order volume, the value of t increases to the threshold T, the retrieval program will be immediately mobilized.

7. A warehousing scheduling method based on a dynamic order scheduling algorithm with thresholds as claimed in claim 1, characterized in that: The items taken out from the picking area are transported to the packaging area through the transfer area for packing. If the items in the same customer order are of different types, they are transported to the same packaging area for packing; The transfer area is a three - level circulation area. All items taken out from the picking area will be placed on the circulating conveyor belt in the first - level area for machine and manual verification of product qualification. If qualified, they will be transferred to the conveyor belt in the second - level area to circulate and wait for other items in the same order. Otherwise, the unqualified products will be taken out and marked in the system, and a new picking requirement will be applied. When all items in the same order have been verified as qualified and transferred to the second - level conveyor belt, the items on the second - level conveyor belt will be continuously circulated to detect whether all items in the same order have been collected. If collected, they can be sequentially transferred to the conveyor belt in the third - level area to reach the packaging area for packing. In this process, the first - in - first - out strategy is adopted. The order that is completed first in collection is transferred to the third - level area for packing first. If not all items are collected, they will continue to circulate and wait; The three - level circulation area of the transfer area is divided into multiple conveyor belts, and items in the same order are transferred to the same conveyor belt; A switch is set in the third - level conveyor belt to prevent items from multiple orders from reaching the packaging area simultaneously. After the items in the current order are packed, the collected items in another order will be released and transferred to the packaging area, and so on.

8. The warehousing scheduling method based on a dynamic order scheduling algorithm with a threshold as claimed in claim 7, wherein: All items in the three - level circulation area must be verified before being transferred to the next area, expressed as: V_{i,j}=1, where V_{i,j} is the verification result of the j - th item in order O_i, 1 for qualified and 0 for unqualified; Using the first - in - first - out strategy, the collected orders are preferentially transferred to the packaging area. When all items of an order are collected, the items of this order can be transferred to the packaging area, expressed as: where T(O_i,C_k) is to transfer the items of order O_i to the circulation area C_k, and P_{packaging} is the packaging area; The switch state of the conveyor belt, expressed as 1 and 0, 1 when there are items arriving and 0 when there are no items arriving; The operation process of the three - level circulation area is as follows: Place the items taken out from the picking area on the conveyor belt in the first - level circulation area for verification, expressed as: P_{picking}\Rightarrow T(O_i,C_1), where P_{picking} is the picking area, and T(O_i,C_k) is to transfer the items of order O_i to the circulation area C_k; The verified qualified items are transferred to the second - level circulation area to wait for other items in the same order, expressed as: T(O_i,C_1)\Rightarrow T(O_i,C_2), where T(O_i,C_k) is to transfer the items of order O_i to the circulation area C_k, C_{1} is the first - level circulation area, and C_{2} is the second - level circulation area; When all items of an order are collected in the second - level circulation area, these items are transferred to the third - level circulation area, expressed as T(O_i,C_2)\Rightarrow T(O_i,C_3), where T(O_i,C_k) is to transfer the items of order O_i to the circulation area C_k, C_{2} is the second - level circulation area, and C_{3} is the third - level circulation area; When the switch state of the three - level circulation area permits, the items in the order are transferred to the packaging area for packing, expressed as: T(O_i,C_3)\land S_{C_3}=1\Rightarrow P_{packaging}, wherein, T(O_i,C_k) is to transfer the items of order O_i to the circulation area C_k, S_{C_{3}} is the switch state of the conveyor belt in the three - level circulation area, 1 means there are items arriving, 0 means there are no items arriving, C_{3} is the three - level circulation area, and P_{packaging} is the packaging area.

9. A computer device, comprising a memory and a processor, the memory storing a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method described in any one of claims 1 to 8.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the method described in any one of claims 1 to 8.

Images