A container scheduling method, device and electronic equipment

Abstract

The application provides a container scheduling method and device and electronic equipment, and relates to the technical field of automated wharf, and comprises the following steps: obtaining yard storage data, wherein the yard storage data comprises a container placement ratio; receiving a reservation container placement request; judging whether a target yard exists based on the reservation container placement request, wherein the target yard comprises a yard meeting the reservation container placement request; when it is judged that the target yard exists based on the reservation container placement request, arranging the target yards in reverse order based on the container placement ratio; and pushing the target yard arranged in the first place in the reverse order. The application improves the container turnover rate and reduces data errors caused by manual operation.

Description

Technical Field

[0001] This invention relates to the field of automated terminal technology, and in particular to a method, apparatus, and electronic equipment for container scheduling. Background Technology

[0002] A shipping container is a set of tools that can carry packaged or unpackaged goods for transport and facilitate loading, unloading and handling by mechanical equipment.

[0003] Currently, the level of informatization of container information and truck fleets in container yards is not high. At the same time, shipping companies have disconnected container management, information silos, and insufficient data sharing, making it impossible to automatically connect various links and achieve intelligent scheduling.

[0004] Therefore, a method, apparatus, and electronic equipment for container scheduling are proposed. Summary of the Invention

[0005] This specification provides a method, apparatus, and electronic equipment for container scheduling, which improves container turnover rate and reduces data errors caused by human operation.

[0006] The container scheduling method provided in this application adopts the following technical solution, including:

[0007] Acquire yard storage data, including the percentage of containers already placed;

[0008] Receive reservation requests for box placement;

[0009] Based on the container reservation request, it is determined whether there is a target storage yard, and the target storage yard includes storage yards that meet the container reservation request;

[0010] When it is determined that the target storage yard exists based on the reservation container placement request, the target storage yards are arranged in reverse order based on the proportion of containers already placed.

[0011] The target storage yard, which is listed first in reverse order, is pushed to the site.

[0012] Optionally, the step of determining whether a target storage yard exists based on the reservation container release request, wherein the target storage yard includes storage yards that satisfy the reservation container release request, includes:

[0013] The yard storage data includes the number of containers that can be placed there;

[0014] Based on the container reservation request, the storage data of the storage yard is traversed to determine whether there is a target storage yard. The target storage yard includes storage yards that can accommodate the number of containers required by the reservation request.

[0015] Optionally, after pushing the target stockpile, which is arranged in reverse order, the process includes:

[0016] The yard storage data also includes the number of containers to be reserved and the number of containers that can be reserved. The container reservation request includes the type of container to be reserved and the number of containers to be reserved.

[0017] Based on the requested container type and requested container quantity, update the reserved container quantity and available container quantity of the target yard that is ranked first in reverse order.

[0018] Optionally, the method further includes:

[0019] If the target storage yard is determined not to exist based on the storage yard data, the scheduling fails and the scheduling ends.

[0020] Optionally, before pushing the target stockpile, which is arranged in reverse order, the following steps are included:

[0021] Obtain the stockpile storage data of the target stockpile, which is listed in reverse order.

[0022] The system then determines whether the number of containers that can be placed in the target storage yard, which is ranked first in reverse order, meets the reservation container placement request.

[0023] When the number of containers that can be placed in the first target yard in reverse order meets the reservation container placement request, the process of pushing the first target yard in reverse order is executed, and the yard storage data of the first target yard in reverse order is updated based on the reservation container placement request.

[0024] Optionally, the method further includes:

[0025] When the number of containers that can be placed in the first target yard in reverse order does not meet the reservation container placement request, the second target yard in reverse order is pushed, and the yard storage data of the second target yard in reverse order is updated based on the reservation container placement request.

[0026] Optionally, the percentage of boxes already placed includes:

[0027] The yard storage data also includes the number of containers already placed and the percentage of containers that can be placed.

[0028] The first result is obtained based on the sum of the number of boxes already placed and the number of boxes scheduled for placement;

[0029] The second result is obtained based on the product of the percentage of boxes that can be placed and the number of boxes that can be placed.

[0030] The proportion of boxes placed is obtained based on the ratio of the first result to the second result.

[0031] The container scheduling device provided in this application adopts the following technical solution, including:

[0032] The storage acquisition module is used to acquire storage data in the storage yard, including the percentage of containers already placed.

[0033] The box placement reservation module is used to receive reservation requests for box placement.

[0034] The first allocation module is used to determine whether there is a target storage yard based on the reservation container placement request, wherein the target storage yard includes storage yards that meet the reservation container placement request;

[0035] The second allocation module is used to, when it is determined that the target storage yard exists based on the reservation container placement request, arrange the target storage yards in reverse order based on the proportion of containers already placed.

[0036] The container placement module is used to push the target storage yard, which is arranged in reverse order.

[0037] Optionally, the first allocation module includes:

[0038] The yard storage data includes the number of containers that can be placed there;

[0039] Based on the container reservation request, the storage data of the storage yard is traversed to determine whether there is a target storage yard. The target storage yard includes storage yards that can accommodate the number of containers required by the reservation request.

[0040] Optionally, after the box placement module, the following is included:

[0041] The yard storage data also includes the number of containers to be reserved and the number of containers that can be reserved. The container reservation request includes the type of container to be reserved and the number of containers to be reserved.

[0042] The data update module is used to update the number of reserved containers and the number of containers that can be placed in the target yard that is ranked in reverse order, based on the requested container type and the requested container quantity.

[0043] Optionally, the device further includes:

[0044] The termination module is used to terminate the scheduling process if the scheduling fails and the target storage yard is determined to be nonexistent based on the storage yard data.

[0045] Optionally, before the box placement module, the following is included:

[0046] Used to obtain the stockyard storage data of the target stockyard that is first in reverse order;

[0047] This is used to determine again whether the number of containers that can be placed in the target storage yard that is ranked first in reverse order meets the reservation container placement request;

[0048] When the number of containers that can be placed in the first target yard in reverse order meets the reservation container placement request, the process of pushing the first target yard in reverse order is executed, and the yard storage data of the first target yard in reverse order is updated based on the reservation container placement request.

[0049] Optionally, the device further includes:

[0050] When the number of containers that can be placed in the first target yard in reverse order does not meet the reservation container placement request, the second target yard in reverse order is pushed, and the yard storage data of the second target yard in reverse order is updated based on the reservation container placement request.

[0051] Optionally, the percentage of boxes already placed includes:

[0052] The yard storage data also includes the number of containers already placed and the percentage of containers that can be placed.

[0053] The first result is obtained based on the sum of the number of boxes already placed and the number of boxes scheduled for placement;

[0054] The second result is obtained based on the product of the percentage of boxes that can be placed and the number of boxes that can be placed.

[0055] The proportion of boxes placed is obtained based on the ratio of the first result to the second result.

[0056] This specification also provides an electronic device, wherein the electronic device includes:

[0057] Processor; and,

[0058] A memory that stores computer-executable instructions, which, when executed, cause the processor to perform any of the methods described above.

[0059] This specification also provides a computer-readable storage medium that stores one or more programs that, when executed by a processor, implement any of the methods described above.

[0060] This invention applies advanced information technology to container management, enabling shipping companies to monitor information at each stage and node of container release in real time, thereby achieving precise container release and improving container turnover. By balancing the allocation of yard capacity, this invention can make the market fairer. The orderly container release process using this invention will not create bottlenecks that affect the entire release process. Attached Figure Description

[0061] Figure 1 This specification provides a schematic diagram illustrating the principle of a container scheduling method in its embodiments;

[0062] Figure 2 This specification provides a schematic diagram of the principle preceding step S105 in a container scheduling method according to an embodiment.

[0063] Figure 3 A schematic diagram of the structure of a container scheduling device provided in the embodiments of this specification;

[0064] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this specification;

[0065] Figure 5 This is a schematic diagram of a computer-readable medium provided for embodiments of this specification. Detailed Implementation

[0066] The following description is intended to disclose the present invention and enable those skilled in the art to implement it. The preferred embodiments described below are merely examples, and other obvious variations will occur to those skilled in the art. The basic principles of the invention defined in the following description can be applied to other embodiments, modifications, improvements, equivalents, and other technical solutions that do not depart from the spirit and scope of the invention.

[0067] The following is in conjunction with the appendix Figure 1-5 Exemplary embodiments of the invention will be further described fully herein. However, exemplary embodiments can be implemented in many forms and should not be construed as limiting the invention to the embodiments set forth herein. Rather, these exemplary embodiments are provided to make the invention more comprehensive and complete, and to facilitate a full communication of the inventive concept to those skilled in the art. The same reference numerals in the figures denote the same or similar elements, components, or parts, and therefore repeated descriptions of them are omitted.

[0068] Subject to the technical concept of this invention, the features, structures, characteristics or other details described in a particular embodiment may be combined in one or more other embodiments in a suitable manner.

[0069] In the description of specific embodiments, the features, structures, characteristics, or other details described in this invention are intended to enable those skilled in the art to fully understand the embodiments. However, it is not excluded that those skilled in the art can practice the technical solutions of this invention without one or more of the specific features, structures, characteristics, or other details.

[0070] The flowcharts shown in the accompanying drawings are merely illustrative and do not necessarily include all content and operations / steps, nor do they necessarily need to be performed in the described order. For example, some operations / steps can be broken down, while others can be combined or partially combined; therefore, the actual execution order may change depending on the specific circumstances.

[0071] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities can be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0072] The terms “and / or” or “and / or” include all combinations of any one or more of the listed items.

[0073] Figure 1 This is a schematic diagram illustrating the principle of a container scheduling method provided in an embodiment of this specification. The method may include:

[0074] S101: Obtain the yard storage data, which includes the percentage of containers already placed;

[0075] In the embodiments described in this specification, yard storage data is accessed via the 802.11 protocol and / or the SIP protocol. Yard storage data can be accessed in real time or at preset intervals. The yard storage data can be manually collected and input, or it can be obtained by tracking and scanning RFID tags on containers.

[0076] In the embodiments of this specification, the percentage of boxes already placed includes:

[0077] The yard storage data also includes the number of containers already placed and the percentage of containers that can be placed.

[0078] The first result is obtained based on the sum of the number of boxes already placed and the number of boxes scheduled for placement;

[0079] The second result is obtained based on the product of the percentage of boxes that can be placed and the number of boxes that can be placed.

[0080] The proportion of boxes placed is obtained based on the ratio of the first result to the second result.

[0081] In the embodiments of this specification, the yard storage data includes the number of containers already placed (AD) and the percentage of containers that can be placed (P%D). Based on the sum of the number of containers already placed (AD) and the number of containers scheduled for placement (RD), a first result is obtained, namely AD+RD. Based on the product of the percentage of containers that can be placed (P%D) and the number of containers that can be placed (SD), a second result is obtained, namely SD*P%D. Based on the ratio of the first result AD+RD to the second result SD*P%D, the percentage of containers already placed (AD+RD) / (SD*P%D) is obtained.

[0082] S102: Receive the reservation request for box placement;

[0083] In the embodiments described in this specification, users can send a reservation request for box placement that meets their own needs via mobile terminal or client.

[0084] S103: Determine whether there is a target storage yard based on the reservation container placement request, wherein the target storage yard includes storage yards that meet the reservation container placement request;

[0085] In this embodiment of the specification, the step of determining whether a target storage yard exists based on the reservation container placement request, wherein the target storage yard includes storage yards that satisfy the reservation container placement request, includes:

[0086] The yard storage data also includes the number of containers that can be placed there;

[0087] Based on the container reservation request, the storage data of the storage yard is traversed to determine whether there is a target storage yard. The target storage yard includes storage yards that can accommodate the number of containers required by the reservation request.

[0088] In the embodiments of this specification, after receiving a container reservation request, the request is compared with the yard inventory data one by one to find the yard inventory data that meets the reservation request. Based on the yard inventory data, the corresponding yard, i.e., the target yard, is found. Specifically, the yard inventory data includes yard A with 0 available containers, yard B with 10 available containers, yard C with 20 available containers, and yard D with 30 available containers. The requested container quantity in the reservation request is 15. That is, the yard inventory data of yard A and yard B do not meet the reservation request, while the yard inventory data of yard C and yard D do. Therefore, yards C and D are the target yards.

[0089] S104: When it is determined that the target storage yard exists based on the reservation container placement request, the target storage yards are arranged in reverse order based on the proportion of containers already placed.

[0090] S105: Push the target stockpile that is first in reverse order.

[0091] In the embodiments described in this specification, this method further includes:

[0092] If, based on the yard data, it is determined that there is no yard that can satisfy the container release request, the scheduling fails and the scheduling ends.

[0093] In the embodiments described in this specification, when a target yard exists, the target yards are arranged in reverse order according to the proportion of containers already placed (i.e., from smallest to largest), and the target yard ranked first in the reverse order, i.e., the target yard with the smallest proportion of containers already placed, is pushed to the system. When no target yard exists, the scheduling fails and the scheduling ends. The user can resend the scheduling request after a set interval, or click to follow the system. When a target yard exists, the system will proactively send a message to the user, prompting them to make another reservation. Specifically, placing containers based on the proportion of containers already placed is used to achieve a balance in container scheduling among the yards, ensuring that each yard is selected as much as possible.

[0094] Reference Figure 2 In the embodiments of this specification, before pushing the target stockpile arranged in reverse order, the following steps are included:

[0095] S1041: Obtain the stockpile storage data of the target stockpile, which is arranged in reverse order;

[0096] S1042: Determine again whether the number of containers that can be placed in the target yard that is ranked first in reverse order meets the reservation container placement request;

[0097] S1043: When the number of containers that can be placed in the first target yard in reverse order meets the reservation container placement request, the first target yard in reverse order is pushed, and the yard storage data of the first target yard in reverse order is updated based on the reservation container placement request.

[0098] In the embodiments described in this specification, the method further includes:

[0099] When the number of containers that can be placed in the first target yard in reverse order does not meet the reservation container placement request, the second target yard in reverse order is pushed, and the yard storage data of the second target yard in reverse order is updated based on the reservation container placement request.

[0100] In the embodiments described in this specification, the storage data of the target storage yard ranked first in reverse order is obtained through an interface. The system then checks again whether the number of containers that can be placed in the target storage yard ranked first in reverse order meets the reservation request, confirming this again to ensure the accuracy of the recommendation. When the number of containers that can be placed in the target storage yard ranked first in reverse order meets the reservation request, the system pushes the target storage yard ranked first in reverse order, i.e., the target storage yard with the smallest proportion of containers already placed. When the number of containers that can be placed in the target storage yard ranked first in reverse order does not meet the reservation request, the system pushes the target storage yard ranked second in reverse order. Before pushing, the system checks again whether the number of containers that can be placed in the target storage yard ranked second in reverse order meets the reservation request, confirming this again to ensure the accuracy of the recommendation. After pushing, the storage data of the pushed storage yards is updated based on the reservation request to ensure the accuracy of the storage data.

[0101] In the embodiments of this specification, after pushing the target stockpile, which is arranged in reverse order, the following steps are included:

[0102] The yard storage data also includes the number of containers to be reserved and the number of containers that can be reserved. The container reservation request includes the type of container to be reserved and the number of containers to be reserved.

[0103] Based on the requested container type and requested container quantity, update the reserved container quantity and available container quantity of the target yard that is ranked first in reverse order.

[0104] In the embodiments of this specification, the yard storage data also includes the number of containers to be reserved and the number of containers that can be placed. The container reservation request includes the requested container type and the requested container quantity. After the target yard is pushed, the number of containers to be reserved and the number of containers that can be placed in the first order of the target yard are updated based on the requested container type and the requested container quantity to ensure real-time access to the yard storage data and ensure the timeliness of the data.

[0105] In summary, this invention applies advanced information technology to container management, enabling shipping companies to monitor information at each stage and node of container release in real time, thereby achieving precise container release and improving container turnover. By balancing the allocation of yard capacity, this invention can make the market fairer, and by releasing containers in an orderly manner, it can prevent congestion and avoid affecting the entire container release process.

[0106] Figure 3 This is a schematic diagram of a container scheduling device provided in an embodiment of this specification. The device may include:

[0107] The storage acquisition module 301 is used to acquire storage data in the storage yard, including the percentage of containers already placed.

[0108] The box placement reservation module 302 is used to receive box placement reservation requests;

[0109] The first allocation module 303 is used to determine whether there is a target storage yard based on the reservation container placement request, wherein the target storage yard includes storage yards that meet the reservation container placement request;

[0110] The second allocation module 304 is used to, when it is determined that the target storage yard exists based on the reservation container placement request, arrange the target storage yards in reverse order based on the proportion of containers already placed.

[0111] The container placement module 305 is used to push the target storage yard, which is arranged in reverse order.

[0112] Optionally, the first allocation module includes:

[0113] The yard storage data includes the number of containers that can be placed there;

[0114] Based on the container reservation request, the storage data of the storage yard is traversed to determine whether there is a target storage yard. The target storage yard includes storage yards that can accommodate the number of containers required by the reservation request.

[0115] Optionally, after the box placement module, the following is included:

[0116] The yard storage data also includes the number of containers to be reserved and the number of containers that can be reserved. The container reservation request includes the type of container to be reserved and the number of containers to be reserved.

[0117] The data update module is used to update the number of reserved containers and the number of containers that can be placed in the target yard that is ranked in reverse order, based on the requested container type and the requested container quantity.

[0118] Optionally, the device further includes:

[0119] The termination module is used to terminate the scheduling process if, based on the yard data, it is determined that there is no yard that satisfies the container release request, the scheduling fails.

[0120] Optionally, before the box placement module, the following is included:

[0121] Used to obtain the stockyard storage data of the target stockyard that is first in reverse order;

[0122] This is used to determine again whether the number of containers that can be placed in the target storage yard that is ranked first in reverse order meets the reservation container placement request;

[0123] When the number of containers that can be placed in the first target yard in reverse order meets the reservation container placement request, the process of pushing the first target yard in reverse order is executed, and the yard storage data of the first target yard in reverse order is updated based on the reservation container placement request.

[0124] Optionally, the device further includes:

[0125] When the number of containers that can be placed in the first target yard in reverse order does not meet the reservation container placement request, the second target yard in reverse order is pushed, and the yard storage data of the second target yard in reverse order is updated based on the reservation container placement request.

[0126] Optionally, the percentage of boxes already placed includes:

[0127] The yard storage data also includes the number of containers already placed and the percentage of containers that can be placed.

[0128] The first result is obtained based on the sum of the number of boxes already placed and the number of boxes scheduled for placement;

[0129] The second result is obtained based on the product of the percentage of boxes that can be placed and the number of boxes that can be placed.

[0130] The proportion of boxes placed is obtained based on the ratio of the first result to the second result.

[0131] The functions of the apparatus in this embodiment have been described in the above method embodiments. Therefore, for any parts not detailed in this embodiment, please refer to the relevant descriptions in the foregoing embodiments, which will not be repeated here.

[0132] Based on the same inventive concept, embodiments of this specification also provide an electronic device.

[0133] The following describes embodiments of the electronic device of the present invention, which can be considered as specific implementations of the methods and apparatus embodiments of the present invention described above. Details described in the embodiments of the electronic device of the present invention should be considered as supplements to the methods or apparatus embodiments described above; details not disclosed in the embodiments of the electronic device of the present invention can be implemented with reference to the methods or apparatus embodiments described above.

[0134] Figure 4 This is a schematic diagram of an electronic device provided as an embodiment of this specification. Refer to the following... Figure 4 To describe the electronic device 400 according to this embodiment of the invention. Figure 4 The electronic device 400 shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of the present invention.

[0135] like Figure 4 As shown, the electronic device 400 is presented in the form of a general-purpose computing device. The components of the electronic device 400 may include, but are not limited to: at least one processing unit 410, at least one storage unit 420, a bus 430 connecting different system components (including storage unit 420 and processing unit 410), a display unit 440, etc.

[0136] The storage unit stores program code that can be executed by the processing unit 410, causing the processing unit 410 to perform the steps described in the processing method section of this specification according to various exemplary embodiments of the present invention. For example, the processing unit 410 can perform, for example... Figure 1 The steps are shown.

[0137] The storage unit 420 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 4201 and / or a cache storage unit 4202, and may further include a read-only memory unit (ROM) 4203.

[0138] The storage unit 420 may also include a program / utility 4204 having a set (at least one) program module 4205, such program module 4205 including but not limited to: an operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0139] Bus 430 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0140] Electronic device 400 can also communicate with one or more external devices 500 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 400, and / or with any device that enables electronic device 400 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 450. Furthermore, electronic device 500 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 460. Network adapter 460 can communicate with other modules of electronic device 400 via bus 430. It should be understood that, although... Figure 4 As not shown, other hardware and / or software modules may be used in conjunction with electronic device 400, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0141] Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described in this invention can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this invention can be embodied in the form of a software product, which can be stored in a computer-readable storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, or network device, etc.) to execute the above-described method according to this invention. When the computer program is executed by a data processing device, it enables the computer-readable medium to implement the above-described method of this invention, i.e.: as... Figure 1 The method shown.

[0142] Figure 5 This is a schematic diagram of a computer-readable medium provided for embodiments of this specification.

[0143] accomplish Figure 1 The computer program of the method shown can be stored on one or more computer-readable media. A computer-readable medium can be a readable signal medium or a readable storage medium. A readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof.

[0144] The computer-readable storage medium may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. The readable storage medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting programs for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0145] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0146] In summary, this invention can be implemented in hardware, or as software modules running on one or more processors, or a combination thereof. Those skilled in the art will understand that in practice, general-purpose data processing devices such as microprocessors or digital signal processors (DSPs) can be used to implement some or all of the functions of some or all of the components according to the embodiments of the invention. The invention can also be implemented as a device or apparatus program (e.g., a computer program and computer program product) for performing part or all of the methods described herein. Such programs implementing the invention can be stored on a computer-readable medium or can take the form of one or more signals. Such signals can be downloaded from an Internet website, provided on a carrier signal, or provided in any other form.

[0147] The specific embodiments described above further illustrate the purpose, technical solution, and beneficial effects of the present invention. It should be understood that the present invention is not inherently related to any specific computer, virtual device, or electronic device, and various general-purpose devices can also implement the present invention. The above descriptions are merely specific embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

[0148] The various embodiments in this specification are described in a progressive manner. The same or similar parts between the various embodiments can be referred to each other. Each embodiment focuses on describing the differences from other embodiments.

[0149] The above description is merely an embodiment of this application and is not intended to limit the scope of this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of the claims of this application.

Claims

1. A method for container scheduling, characterized in that, include: Obtain yard storage data, which includes the number of containers available for placement, the number of containers scheduled for placement, the number of containers already placed, and the percentage of containers available for placement; A first result is obtained based on the sum of the number of boxes already placed and the number of boxes scheduled for placement; a second result is obtained based on the product of the percentage of boxes that can be placed and the number of boxes that can be placed; and the percentage of boxes already placed is obtained based on the ratio of the first result to the second result. Receive reservation requests for box placement; Based on the container reservation request, it is determined whether there is a target storage yard, and the target storage yard includes storage yards that meet the container reservation request; When it is determined that the target storage yard exists based on the reservation container placement request, the target storage yards are arranged in reverse order based on the proportion of containers already placed. Obtain the stockpile storage data of the target stockpile, which is listed in reverse order. The system then determines whether the number of containers that can be placed in the target storage yard, which is ranked first in reverse order, meets the reservation container placement request. When the number of containers that can be placed in the first target yard in reverse order meets the reservation container placement request, the first target yard in reverse order is pushed, and the yard storage data of the first target yard in reverse order is updated based on the reservation container placement request.

2. The container scheduling method as described in claim 1, characterized in that, The step of determining whether a target storage yard exists based on the reservation container placement request, wherein the target storage yard includes storage yards that satisfy the reservation container placement request, including: The yard storage data also includes the number of containers that can be placed there; Based on the container reservation request, the storage data of the storage yard is traversed to determine whether there is a target storage yard. The target storage yard includes storage yards that can accommodate the number of containers required by the reservation request.

3. The container scheduling method as described in claim 1, characterized in that, Also includes: If the target storage yard is determined not to exist based on the storage yard data, the scheduling fails and the scheduling ends.

4. The container scheduling method as described in claim 1, characterized in that, After pushing the target stockpile, which is arranged in reverse order, the process includes: The reservation box placement request includes the requested box type and the requested box quantity; Based on the requested container type and requested container quantity, update the reserved container quantity and available container quantity of the target yard that is ranked first in reverse order.

5. The container scheduling method as described in claim 4, characterized in that, Also includes: When the number of containers that can be placed in the first target yard in reverse order does not meet the reservation container placement request, the second target yard in reverse order is pushed, and the yard storage data of the second target yard in reverse order is updated based on the reservation container placement request.

6. A container scheduling device, characterized in that, include: The yard storage acquisition module is used to acquire yard storage data, which includes the number of containers that can be placed, the number of containers scheduled for placement, the number of containers that have been placed, and the percentage of containers that can be placed. A first result is obtained based on the sum of the number of boxes already placed and the number of boxes scheduled for placement; a second result is obtained based on the product of the percentage of boxes that can be placed and the number of boxes that can be placed; and the percentage of boxes already placed is obtained based on the ratio of the first result to the second result. The box placement reservation module is used to receive reservation requests for box placement. The first allocation module is used to determine whether there is a target storage yard based on the reservation container placement request, wherein the target storage yard includes storage yards that meet the reservation container placement request; The second allocation module is used to, when it is determined that the target storage yard exists based on the reservation container placement request, arrange the target storage yards in reverse order based on the proportion of containers already placed; The container placement module is used to obtain the storage data of the target storage yard that is ranked first in reverse order; and then determine whether the number of containers that can be placed in the target storage yard that is ranked first in reverse order meets the reservation container placement request. When the number of containers that can be placed in the first target yard in reverse order meets the reservation container placement request, the first target yard in reverse order is pushed, and the yard storage data of the first target yard in reverse order is updated based on the reservation container placement request.

7. An electronic device, wherein, The electronic device includes: A processor; and a memory storing computer-executable instructions, which, when executed, cause the processor to perform the method according to any one of claims 1-5.

8. A computer-readable storage medium, wherein, The computer-readable storage medium stores one or more programs that, when executed by a processor, implement the method of any one of claims 1-5.

Images