Scheduling Method, Device, Equipment and Computer Readable Storage Medium for Bulk Cargo Terminal

Abstract

The present application relates to a production scheduling method, device, equipment and computer-readable storage medium for a DC bulk cargo terminal. The method creates nodes of a directed acyclic graph based on the equipment instructions of the bulk cargo terminal; obtains a replacement relationship rule base, and based on the replacement relationship rule base, obtains the connection relationships of each node; when the connection relationships of each node are replacement relationships, creates directed edges of the directed acyclic graph based on the replacement relationships; obtains production scheduling information based on the nodes and directed edges of the directed acyclic graph and outputs it; improves the number of instructions in a single production scheduling plan, eliminates the need to repeatedly update and iterate the production scheduling plan during the production process, provides a complete and accurate data structure for simulating and deducing the production scheduling plan, and provides the possibility for automatic execution control of the production scheduling plan. This method realizes comprehensive planning and mastery of the production situation over a relatively long period of time, improves the efficiency of plan adjustment, and reduces production delays.

Description

Technical Field

[0001] This application relates to the field of production technology, and particularly to a production scheduling method, device, equipment, and computer-readable storage medium for a bulk cargo terminal. Background Art

[0002] With the development of the economy, the production level of bulk cargo terminals has gradually improved, and the complexity of production scheduling has also increased accordingly. When the number of instructions reaches a certain scale, it is difficult for traditional manual methods to accurately judge the constraint relationships between various instructions. Therefore, during the production process, it is necessary to repeatedly update the production scheduling information according to the production situation and production plan, and it is impossible to comprehensively plan and master the production situation over a relatively long period. At the same time, when adjusting the order of a certain instruction, resulting in an adjustment of the overall production scheduling information, it is necessary to manually re-judge the constraint relationships between instructions, which is likely to miss the window period for plan adjustment, causing production delays. Moreover, when adjusting the successor relationships between instructions, it is also necessary to avoid cyclic succession between instructions, making manual operation difficult and inefficient. Summary of the Invention

[0003] Based on this, it is necessary to provide a production scheduling method, device, equipment, and computer-readable storage medium that can improve the production efficiency of bulk cargo terminals for the above technical problems.

[0004] A production scheduling method for a bulk cargo terminal includes the steps of:

[0005] Establishing nodes of a directed acyclic graph based on the equipment instructions of the bulk cargo terminal;

[0006] Obtaining a successor relationship rule library and, according to the successor relationship rule library, obtaining the connection relationships of each node;

[0007] When the connection relationships of each node are successor relationships, establishing directed edges of the directed acyclic graph based on the successor relationships;

[0008] Obtaining production scheduling information based on the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph and outputting the same.

[0009] In one embodiment, the step of obtaining production scheduling information based on the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph includes:

[0010] When there are no production scheduling sequence nodes in the directed acyclic loop, outputting a preset prompt message; a production scheduling sequence node is a node with an in-degree of zero or an out-degree of zero;

[0011] When there are production scheduling sequence nodes in the directed acyclic loop, deleting the production scheduling sequence nodes of the directed acyclic graph and the directed edges of the production scheduling sequence nodes to obtain a directed acyclic loop;

[0012] Obtaining production scheduling information based on the directed acyclic loop and the production scheduling sequence nodes.

[0013] In one embodiment, the step of obtaining scheduling information according to the directed acyclic circuit and the scheduling sequence nodes includes:

[0014] When the directed acyclic circuit is empty, sort the scheduling sequence nodes to obtain scheduling information.

[0015] In one embodiment, the step of deleting the scheduling sequence nodes of the directed acyclic graph and the directed edges of the scheduling sequence nodes to obtain a directed acyclic circuit; the scheduling sequence nodes are the nodes with an in-degree of zero or an out-degree of zero includes:

[0016] Determine any node with an in-degree of zero in the directed acyclic graph as a scheduling sequence node;

[0017] Delete the scheduling sequence node and the out-edge of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic circuit, and update the directed acyclic graph to the directed acyclic circuit;

[0018] Repeat the steps of determining any node with an in-degree of zero in the directed acyclic graph as a scheduling sequence node; deleting the scheduling sequence node and the out-edge of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic circuit, and updating the directed acyclic graph to the directed acyclic circuit until there is no node with an in-degree of zero in the directed acyclic circuit;

[0019] Determine any node with an out-degree of zero in the directed acyclic graph as a scheduling sequence node;

[0020] Delete the scheduling sequence node and the in-edge of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic circuit, and update the directed acyclic graph to the directed acyclic circuit;

[0021] Repeat the steps of determining any node with an out-degree of zero in the directed acyclic graph as a scheduling sequence node; deleting the scheduling sequence node and the in-edge of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic circuit, and updating the directed acyclic graph to the directed acyclic circuit until there is no node with an out-degree of zero in the directed acyclic circuit.

[0022] In one embodiment, the step of obtaining the connection relationship of each node according to the successor relationship rule base includes:

[0023] Obtain the identification information, equipment process line information, and production resource information of each node;

[0024] Compare each identification information, each equipment process line information, and each production resource information using the successor relationship rule base, and obtain the connection relationship of each node according to the comparison result.

[0025] In one embodiment, the scheduling method for the bulk cargo terminal further includes the steps:

[0026] When the connection relationship between each node is an independent relationship, each node is determined as production scheduling information and output.

[0027] In one embodiment, the production scheduling method for a bulk cargo terminal further comprises the steps of:

[0028] The nodes of the directed acyclic graph are dragged and dropped to obtain an updated directed acyclic graph.

[0029] A production scheduling device for a bulk cargo terminal, comprising:

[0030] A node establishment module, used to establish nodes of a directed acyclic graph based on equipment instructions of a bulk cargo terminal;

[0031] A connection relationship judgment module is used to obtain a succession relationship rule base and obtain the connection relationship of each node according to the succession relationship rule base;

[0032] A directed edge establishment module, used for establishing directed edges of a directed acyclic graph based on the succession relationship when the connection relationship between the nodes is a succession relationship;

[0033] The production scheduling information acquisition module is used to obtain and output the production scheduling information according to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph.

[0034] A production scheduling device for a bulk cargo terminal, comprising:

[0035] A processor is used to implement the steps of the above method.

[0036] A display is used to display production scheduling information.

[0037] A computer-readable storage medium stores a computer program, which implements the steps of the above method when executed by a processor.

[0038] The above-mentioned production scheduling method for bulk cargo terminals establishes nodes of a directed acyclic graph based on the equipment instructions of the bulk cargo terminals; obtains a succession relationship rule base, and obtains the connection relationship of each node based on the succession relationship rule base; when the connection relationship of each node is a succession relationship, a directed edge of a directed acyclic graph is established based on the succession relationship; according to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph, the production scheduling information is obtained and output; the number of instructions for making a single production scheduling plan is increased, and there is no need to repeatedly update and iterate the production scheduling plan during the production process, which provides a complete and accurate data structure for simulating and deducing the production scheduling plan, and makes it possible to automatically execute and control the production scheduling plan. This method realizes comprehensive planning and grasps the production situation over a long period of time, improves the efficiency of plan adjustment, and reduces production delays. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] To more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the accompanying drawings required for the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, without creative efforts, other accompanying drawings can be obtained based on these drawings.

[0040] Figure 1 It is a first schematic flowchart of the production scheduling method for a bulk cargo terminal in an embodiment;

[0041] Figure 2 It is a flowchart of the steps for obtaining production scheduling information based on the nodes and directed edges of a directed acyclic graph in an embodiment;

[0042] Figure 3 It is a flowchart of the steps for deleting the production scheduling sequence nodes and the directed edges of the production scheduling sequence nodes of a directed acyclic graph to obtain a directed acyclic loop; the production scheduling sequence nodes are nodes with an in-degree of zero or an out-degree of zero in an embodiment;

[0043] Figure 4 It is a flowchart of the steps for obtaining the connection relationships of each node according to the successor relationship rule base in an embodiment;

[0044] Figure 5 It is a first schematic structural diagram of a directed acyclic graph in an embodiment;

[0045] Figure 6 It is a second schematic structural diagram of a directed acyclic graph in an embodiment;

[0046] Figure 7 It is a structural diagram of production scheduling information in an embodiment. Detailed implementation manners

[0047] To facilitate the understanding of the present application, the following will describe the present application more comprehensively with reference to the relevant accompanying drawings. Embodiments of the present application are given in the accompanying drawings. However, the present application can be implemented in many different forms and is not limited to the embodiments described herein. On the contrary, the purpose of providing these embodiments is to make the disclosure of the present application more thorough and comprehensive.

[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those of ordinary skill in the technical field to which the present application belongs. The terms used in the description of the present application in this specification are only for the purpose of describing specific embodiments and are not intended to limit the present application.

[0049] It will be understood that the terms "a", "an" and "the" as used in this application may also include the plural forms, unless the context clearly dictates otherwise. It should also be understood that the terms "comprising" or "having" etc. specify the presence of the stated features, integers, steps, operations, components, parts or combinations thereof, but do not preclude the presence or addition of one or more other features, integers, steps, operations, components, parts or combinations thereof.

[0050] When the number of instructions in the production scheduling plan reaches a certain scale, it is difficult to accurately judge the constraint relationships among the instructions by traditional manual methods. Therefore, the production scheduling plan made at one time cannot contain too many instructions. During the production process, it is necessary to iteratively update the production scheduling plan according to the production situation and production plan repeatedly, and it is impossible to comprehensively plan and master the production situation in a relatively long period of time.

[0051] At the same time, when adjusting the order of a certain instruction, which causes the adjustment of the overall production scheduling plan, it is necessary to manually re-judge the constraint relationships among the instructions, which is likely to miss the window period for plan adjustment, resulting in production delays. Moreover, when adjusting the successor relationships among the instructions, it is also necessary to avoid cyclic succession among the instructions, and the manual operation is difficult and inefficient.

[0052] In addition, the lack of an interactive display method for the production scheduling plan when the central control dispatcher formulates the production scheduling plan also results in the inability to accurately obtain the overall situation of the production scheduling plan, and it is even more difficult to weigh and compare different production scheduling plans.

[0053] In view of this, the present invention provides a production scheduling method, device, equipment and computer-readable storage medium that can improve the production efficiency of bulk terminals.

[0054] In one embodiment, as Figure 1 shown, a production scheduling method for a bulk terminal is provided, including the steps of:

[0055] S110, establishing nodes of a directed acyclic graph based on the equipment instructions of the bulk terminal;

[0056] Specifically, a directed acyclic graph is a directed graph without loops, abbreviated as a DAG; a device instruction refers to the production process in the production scheduling operation of a bulk cargo terminal, where, according to the production plan, a certain device process line and corresponding production resources are selected, and the operation end conditions (operation volume or number of operation carriages) are specified. That is, the device instruction includes the identification information of the instruction, the device process line information, and the production resource information. Specifically, when staff compile the production scheduling plan, the lack of an interactive production scheduling plan display method also makes it impossible to accurately know the overall situation of the production scheduling plan, and it is difficult to make a trade-off comparison between different production scheduling plans. When the number of device instructions reaches a certain scale, taking each device instruction as a node of the directed acyclic graph can more intuitively display the device instructions, facilitate the implementation of the production scheduling operation, and provide the possibility for the automated execution control of the production scheduling plan.

[0057] S120, obtain the successor relationship rule base, and based on the successor relationship rule base, obtain the connection relationships of each node;

[0058] Specifically, the successor relationship rule base includes any one or several combinations of the following: the device process line used by the instruction contains duplicate devices; the instruction occupies the same stack yard or silo; the instruction occupies the same ship hatch; the spatial positions of the stacker and reclaimer cross-interfere; the stacker and reclaimer interfere with each other during close-range operation; the same-stack and same-reclaim rule for the stacker and stack-reclaimer; the spatial positions of the ship loader cross-interfere during operation; the ship loader interferes with each other during close-range operation. The connection relationships include an independent relationship and a successor relationship. The independent relationship means that the device instructions in two nodes are independent of each other, indicating that the device instructions can start execution immediately, do not interfere with each other, and can be executed in parallel; the successor relationship is the sequential relationship between instructions, and they need to interfere with each other. Specifically, since the device instructions are represented by nodes, the connection relationships of the instructions included in each node are judged according to the successor relationship rule base. The judgment of the connection relationships can be made manually or automatically identified by a computer program, and no limitation is made here.

[0059] S130, in the case where the connection relationships of each node are successor relationships, establish directed edges of the directed acyclic graph based on the successor relationships;

[0060] Specifically, the succession relationship includes a replacement relationship and a continuation relationship. In the continuation relationship, the subsequent instruction waits for the previous instruction to release the equipment before it starts to execute. In the replacement relationship, the subsequent instruction directly replaces the previous instruction. The previous instruction is completed in advance and releases the equipment for the subsequent instruction to use. When there is a succession relationship, it is necessary to specify the succession relationship between the equipment instruction A and the equipment instruction B with which it generates the succession relationship. For the executed equipment instruction B1, it can be replaced or continued. For the unexecuted equipment instruction B2, it can be continued or pre-positioned. The pre-position relationship is also a continuation relationship, that is, the unexecuted equipment instruction B2 is connected to instruction A. The directed edges of the directed acyclic graph can clearly reflect the execution order of the instructions. When the number of equipment instructions reaches a certain level, the edges of the directed acyclic graph are used to represent the execution order of the instructions, which is clearer and improves the production scheduling efficiency of the bulk terminal.

[0061] S140, obtaining and outputting production scheduling information according to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph.

[0062] Specifically, the production scheduling information is the production scheduling plan, which refers to the production arrangement of the prepared equipment instructions in a certain succession relationship. When the number of equipment instructions is small, that is, the number of nodes in the directed acyclic graph is small, the directed acyclic graph is directly output to obtain the production scheduling information; when the number of equipment instructions reaches a certain number, the nodes and directed edges of the directed acyclic graph can be sorted in a forward and reverse topological manner to obtain the production scheduling information. Figure 5 As shown, a directed acyclic graph is provided, 10 represents a node of the directed acyclic graph, and 11 represents a directed edge of the directed acyclic graph.

[0063] The above-mentioned production scheduling method for bulk cargo terminals establishes nodes of a directed acyclic graph based on the equipment instructions of the bulk cargo terminals; obtains a succession relationship rule base, and obtains the connection relationship of each node based on the succession relationship rule base; when the connection relationship of each node is a succession relationship, a directed edge of a directed acyclic graph is established based on the succession relationship; according to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph, the production scheduling information is obtained and output; the number of instructions for making a single production scheduling plan is increased, and there is no need to repeatedly update and iterate the production scheduling plan during the production process, which provides a complete and accurate data structure for simulating and deducing the production scheduling plan, and makes it possible to automatically execute and control the production scheduling plan. This method realizes comprehensive planning and grasps the production situation over a long period of time, improves the efficiency of plan adjustment, and reduces production delays.

[0064] In one embodiment, Figure 2 As shown, the steps of obtaining the production scheduling information according to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph include:

[0065] S150, when there is no scheduling sequence node in the directed acyclic loop, output a preset prompt message; the scheduling sequence node is a node with an in-degree of zero or an out-degree of zero;

[0066] Specifically, after the nodes of the directed acyclic graph are updated, first check whether there is a closed loop in the directed acyclic graph. If there is a closed loop, a preset prompt message should be sent to the staff. The preset prompt message is an error message used to instruct the staff to check the directed acyclic graph. Suppose there is a node V in the directed acyclic graph. The in-degree is the number of all directed edges starting from other nodes and ending at V, that is, the number of all directed edges pointing to V. The out-degree is the number of all directed edges starting from V and pointing to other nodes.

[0067] S160, when there is a scheduling sequence node in the directed acyclic loop, delete the scheduling sequence node of the directed acyclic graph and the directed edges of the scheduling sequence node to obtain a directed acyclic loop;

[0068] S170, obtain scheduling information according to the directed acyclic loop and the scheduling sequence node.

[0069] In one embodiment, the step of obtaining scheduling information according to the directed acyclic loop and the scheduling sequence node includes:

[0070] S180, when the directed acyclic loop is empty, sort the scheduling sequence nodes to obtain scheduling information.

[0071] Specifically, when the device instructions reach a certain scale, the nodes and directed edges of the directed acyclic graph can be sorted topologically forward and backward. The directed acyclic loop refers to the directed acyclic graph after deleting the nodes with an in-degree or out-degree of zero and the directed edges of the nodes. Specifically, after the nodes of the directed acyclic graph are updated, first check whether there is a closed loop in the directed acyclic graph. If there is a closed loop, that is, when there is no scheduling sequence node, an error message should be sent to the staff to instruct the staff to check the directed acyclic graph. If there is no closed loop in the directed acyclic graph, that is, when there is a scheduling sequence node, then repeatedly delete the nodes with an in-degree or out-degree of zero in the directed acyclic graph and the directed edges of the node until the directed acyclic loop is empty; at this time, sort and execute the scheduling sequence nodes in turn to obtain the scheduling information. As Figure 6 shown, a directed acyclic graph is provided, as Figure 7 shown, a scheduling information is provided.

[0072] The above production scheduling method for the bulk cargo terminal can timely detect error information of equipment instructions through a directed acyclic graph and adjust the equipment instructions in a timely manner. By determining whether the directed acyclic loop is empty, all nodes can be traversed and all equipment instructions can be executed, without missing any instruction due to the excessive number of equipment instructions. At the same time, the number of instructions in a single production scheduling plan can be increased, and there is no need to repeatedly update and iterate the production scheduling plan during the production process.

[0073] In one embodiment, as Figure 3 shown, delete the production scheduling sequence node of the directed acyclic graph and the directed edges of this production scheduling sequence node to obtain a directed acyclic loop; the steps of the production scheduling sequence node being a node with an in-degree of zero or an out-degree of zero include:

[0074] S190, determine any node with an in-degree of zero in the directed acyclic graph as the production scheduling sequence node;

[0075] S200, delete the production scheduling sequence node and the out-edge of this production scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop;

[0076] S210, repeatedly execute the steps of determining any node with an in-degree of zero in the directed acyclic graph as the production scheduling sequence node; deleting the production scheduling sequence node and the out-edge of this production scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there is no node with an in-degree of zero in the directed acyclic loop;

[0077] S220, determine any node with an out-degree of zero in the directed acyclic graph as the production scheduling sequence node;

[0078] S230, delete the production scheduling sequence node and the in-edge of this production scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop;

[0079] S240, repeatedly execute the steps of determining any node with an out-degree of zero in the directed acyclic graph as the production scheduling sequence node; deleting the production scheduling sequence node and the in-edge of this production scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there is no node with an out-degree of zero in the directed acyclic loop.

[0080] Specifically, after the staff make a number of equipment instructions according to the daily production plan, when compiling the production scheduling plan, they need to manually and repeatedly judge the equipment process lines involved in the instructions, the interlocking limit conditions of production resources, and the safety specifications of production operations, and then sort the instructions in sequence to form the production scheduling plan, which is very inefficient. The above production scheduling method for bulk terminals reduces the number of directed edges of the directed acyclic graph, helping the staff clearly and definitely judge the overall situation of the production scheduling plan and the true execution order between instructions. At the same time, the above production scheduling method provides a data structure with lower complexity for deducing and calculating the production process of the production scheduling plan, which is more conducive to clarifying the connection relationship of complex equipment instruction nodes, improving the calculation efficiency, and thus improving the compilation efficiency of the production scheduling plan.

[0081] In one embodiment, as Figure 4 shown, the steps of obtaining the connection relationship of each node according to the succession relationship rule base include:

[0082] S250, obtain the identification information, equipment process line information, and production resource information of each node;

[0083] S260, use the succession relationship rule base to compare each identification information, each equipment process line information, and each production resource information, and obtain the connection relationship of each node according to the comparison result.

[0084] Specifically, the succession relationship rule base includes any one or several combinations of the following: the equipment process line used by the instruction includes duplicate equipment; the instruction occupies the same stack or silo; the instruction occupies the same ship hatch; the spatial positions of the stacker and reclaimer interfere with each other; the stacker and reclaimer interfere with each other during close-range operation; the stacker, reclaimer, and stacker-reclaimer have the same stacking and reclaiming rules; the spatial positions of the ship loader interfere with each other during cross-operation; the ship loader interferes with each other during close-range operation. Specifically, each node includes identification information, equipment process line information, and production resource information; among them, the identification information includes mechanical equipment for loading, unloading, and transporting coal materials, including car dumper, stacker, tripper car, reclaimer, activation feeder, ship loader, belt conveyor, stacker-reclaimer, and auxiliary equipment, etc.; the production resource information refers to the stacks and silos for stacking and reclaiming coal materials for the stacker, reclaimer, and stacker-reclaimer, and the berths for docking ships for the ship loader to work; the equipment process line information refers to the combination of production equipment arranged in sequence to complete a certain production process, and the same production equipment can be occupied by different equipment process lines.

[0085] In one embodiment, the production scheduling method for bulk terminals further includes the steps of:

[0086] When the connection relationship of each node is an independent relationship, determine each node as production scheduling information and output it.

[0087] Specifically, the independent relationship means that the device instructions in two nodes are independent of each other, indicating that the device instructions can start execution immediately, do not interfere with each other, and can be executed in parallel. When the connection relationship between each node is an independent relationship, the production scheduling information is the device instructions of each node.

[0088] In one embodiment, the production scheduling method for a bulk cargo terminal further includes the steps of:

[0089] Drag and drop the nodes of the directed acyclic graph to obtain an updated directed acyclic graph.

[0090] Specifically, during the compilation of production scheduling information and the actual production process, the successor relationship between instructions with a successor relationship and the addition and deletion of nodes can be adjusted at any time, that is, the direction and attributes of the directed edges of the DAG are changed. This is especially important when the production plan is adjusted or the equipment health condition changes. Each adjustment requires recalculating the production scheduling information, ensuring the efficiency and executability of the scheme calculation, improving the efficiency of scheme adjustment, and reducing production delays. Specifically, the staff can, in the web page, through interactive methods such as clicking and dragging, continuously adjust and optimize the production scheduling directed acyclic graph, which is more intuitive and accurate than the previous traditional manual method. At the same time, the number of device instructions in a single compilation and adjustment of the production scheduling plan can be increased, and multiple copies of production scheduling information can be cached for trade-off comparison and optimal selection.

[0091] It should be understood that although Figures 1-4 the steps in the flowchart of Figures 1-4 are shown in sequence according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless there is a clear indication in this article, the execution of these steps has no strict order limit, and these steps can be executed in other orders. Moreover,

[0092] In one embodiment, a production scheduling device for a bulk cargo terminal is provided, including:

[0093] A node establishment module for establishing the nodes of a directed acyclic graph based on the device instructions of the bulk cargo terminal;

[0094] A connection relationship judgment module for obtaining a successor relationship rule library and obtaining the connection relationship of each node according to the successor relationship rule library;

[0095] A directed edge establishment module, configured to establish directed edges of a directed acyclic graph based on a succession relationship when the connection relationships of nodes are succession relationships;

[0096] A scheduling information acquisition module, configured to obtain scheduling information according to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph and output the same.

[0097] In one embodiment, the scheduling information module includes:

[0098] A preset prompt information output module, configured to output preset prompt information when there are no scheduling sequence nodes in the directed acyclic loop; a scheduling sequence node is a node with an in-degree of zero or an out-degree of zero;

[0099] A directed acyclic loop acquisition module, configured to, when there are scheduling sequence nodes in the directed acyclic loop, delete the scheduling sequence nodes of the directed acyclic graph and the directed edges of the scheduling sequence nodes to obtain a directed acyclic loop;

[0100] A scheduling sequence node processing module, configured to obtain scheduling information according to the directed acyclic loop and the scheduling sequence nodes.

[0101] In one embodiment, the scheduling sequence node processing module includes:

[0102] A scheduling sequence node sorting module, configured to sort the scheduling sequence nodes to obtain scheduling information when the directed acyclic loop is empty.

[0103] In one embodiment, the directed acyclic loop acquisition module includes:

[0104] An in-degree determination module, configured to determine any node with an in-degree of zero in the directed acyclic graph as a scheduling sequence node;

[0105] A first update module, configured to delete the scheduling sequence node and the out-edges of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop;

[0106] A first repeated execution module, configured to repeatedly execute the steps of determining any node with an in-degree of zero in the directed acyclic graph as a scheduling sequence node; deleting the scheduling sequence node and the out-edges of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there are no nodes with an in-degree of zero in the directed acyclic loop;

[0107] An out-degree determination module, configured to determine any node with an out-degree of zero in the directed acyclic graph as a scheduling sequence node;

[0108] A second update module, configured to delete a scheduling sequence node and the incoming edges of the scheduling sequence node in a directed acyclic graph, obtain a directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop;

[0109] A second repeated execution module, configured to repeatedly execute the steps of determining any node with an out-degree of zero in the directed acyclic graph as a scheduling sequence node; deleting the scheduling sequence node and the incoming edges of the scheduling sequence node in the directed acyclic graph, obtaining a directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there are no nodes with an out-degree of zero in the directed acyclic loop.

[0110] In one embodiment, the connection relationship determination module includes:

[0111] An information acquisition module, configured to acquire the identification information, equipment process line information, and production resource information of each node;

[0112] A comparison module, configured to compare the identification information, equipment process line information, and production resource information of each node using a replacement relationship rule base, and obtain the connection relationship of each node according to the comparison result.

[0113] In one embodiment, the scheduling device of the bulk cargo terminal further includes:

[0114] An independent output module, configured to determine each node as scheduling information and output it when the connection relationship of each node is an independent relationship.

[0115] In one embodiment, the scheduling device of the bulk cargo terminal further includes:

[0116] A drag module, configured to perform a drag process on the nodes of the directed acyclic graph to obtain an updated directed acyclic graph.

[0117] For the specific limitations of the scheduling device of the bulk cargo terminal, reference can be made to the limitations of the scheduling method of the bulk cargo terminal in the foregoing text, which will not be elaborated here. Each module in the above scheduling device of the bulk cargo terminal can be implemented in whole or in part by software, hardware, and their combination. The above modules can be embedded in the processor of the computer device in hardware form or be independent of it, or can be stored in the memory of the computer device in software form, so as to facilitate the processor to call and execute the operations corresponding to the above modules. It should be noted that the division of modules in the embodiments of the present application is illustrative, only a logical function division, and there may be other division methods in actual implementation.

[0118] In one embodiment, a scheduling device for a bulk cargo terminal is provided, including:

[0119] A processor, configured to implement the steps of the above method.

[0120] A display, configured to display scheduling information.

[0121] In one embodiment, a computer-readable storage medium stores a computer program thereon, and when the computer program is executed by a processor, the steps of the following method are implemented:

[0122] Based on the equipment instructions of the bulk cargo terminal, establish the nodes of a directed acyclic graph;

[0123] Obtain the successor relationship rule base, and according to the successor relationship rule base, obtain the connection relationships of the nodes;

[0124] When the connection relationships of the nodes are successor relationships, establish the directed edges of the directed acyclic graph based on the successor relationships;

[0125] According to the nodes of the directed acyclic graph and the directed edges of the directed acyclic graph, obtain the production scheduling information and output it.

[0126] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented:

[0127] When there are no production scheduling sequence nodes in the directed acyclic loop, output a preset prompt message; the production scheduling sequence nodes are nodes with an in-degree of zero or an out-degree of zero;

[0128] When there are production scheduling sequence nodes in the directed acyclic loop, delete the production scheduling sequence nodes of the directed acyclic graph and the directed edges of the production scheduling sequence nodes to obtain a directed acyclic loop;

[0129] According to the directed acyclic loop and the production scheduling sequence nodes, obtain the production scheduling information.

[0130] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented:

[0131] When the directed acyclic loop is empty, sort the production scheduling sequence nodes to obtain the production scheduling information.

[0132] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented:

[0133] Determine any node with an in-degree of zero in the directed acyclic graph as a production scheduling sequence node;

[0134] Delete the production scheduling sequence node and the out-edge of the production scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop;

[0135] Repeat the steps of determining any node with an in-degree of zero in the directed acyclic graph as a production scheduling sequence node; deleting the production scheduling sequence node and the out-edge of the production scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there are no nodes with an in-degree of zero in the directed acyclic loop;

[0136] Determine any node with an out-degree of zero in the directed acyclic graph as a scheduling sequence node;

[0137] Delete the scheduling sequence node and the incoming edges of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop;

[0138] Repeat the steps of determining any node with an out-degree of zero in the directed acyclic graph as a scheduling sequence node; deleting the scheduling sequence node and the incoming edges of the scheduling sequence node in the directed acyclic graph to obtain a directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there are no nodes with an out-degree of zero in the directed acyclic loop.

[0139] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented:

[0140] Obtain the identification information, device process line information, and production resource information of each node;

[0141] Compare the identification information, device process line information, and production resource information of each node using the successor relationship rule base, and obtain the connection relationship of each node according to the comparison result.

[0142] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented:

[0143] When the connection relationships of the nodes are independent relationships, determine each node as scheduling information and output it.

[0144] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented:

[0145] Perform a drag-and-drop process on the nodes of the directed acyclic graph to obtain an updated directed acyclic graph.

[0146] 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, storage, database, or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memories. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical memory, etc. Volatile memory can include random access memory (RAM) or external cache memory. 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.

[0147] In the description of this specification, the description referring to terms such as "some embodiments", "other embodiments", "ideal embodiments", etc. means that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic description of the above terms does not necessarily refer to the same embodiment or example.

[0148] The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as the scope described in this specification.

[0149] The above-described embodiments merely represent several implementation manners of the present application. The description is relatively specific and detailed, but it should not be construed as a limitation on the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application should be subject to the appended claims.

Claims

1. A production scheduling method for a bulk cargo terminal, characterized in that Including the steps: Based on the equipment instructions of the bulk cargo terminal, nodes of a directed acyclic graph are established; the equipment instructions include identification information of the instructions, equipment process line information, and production resource information; Obtain a successor relationship rule library, and based on the successor relationship rule library, obtain the connection relationships of the nodes; the connection relationships include successor relationships; wherein, the successor relationship rule library includes any one or a combination of several of the following: the equipment process line used by the equipment instructions contains duplicate equipment; the equipment instructions occupy the same stack or silo; the equipment instructions occupy the same ship hatch; the spatial positions of the stacker and the reclaimer cross-interfere; the stacker and the reclaimer interfere with each other during close-range operation; the same-stack and same-reclaim rule for the stacker and the stack-reclaimer; the spatial positions of the ship loader cross-interfere during operation; the ship loader interferes with each other during close-range operation; the successor relationships include substitution relationships and continuation relationships; in the continuation relationship, the subsequent instruction waits for the previous instruction to release the equipment before starting to execute, and in the substitution relationship, the subsequent instruction directly replaces the previous instruction, and the previous instruction is completed in advance and releases the equipment for the subsequent instruction to use; When the connection relationships of the nodes are successor relationships, based on the successor relationships, directed edges of the directed acyclic graph are established; the directed edges are used to reflect the execution order of the equipment instructions; When the number of nodes in the directed acyclic graph is less than a preset node number threshold, directly output the directed acyclic graph to obtain scheduling information and output it; When the number of nodes in the directed acyclic graph is greater than or equal to the preset node number threshold, perform forward topological sorting and reverse topological sorting on the nodes and directed edges of the directed acyclic graph to obtain scheduling information and output it.

2. The production scheduling method for a bulk cargo terminal according to claim 1, characterized in that The method further includes: When there are no scheduling sequence nodes in the directed acyclic graph, output a preset prompt message; the scheduling sequence nodes are nodes with an in-degree of zero or an out-degree of zero; When there are scheduling sequence nodes in the directed acyclic graph, delete the scheduling sequence nodes of the directed acyclic graph and the directed edges of the scheduling sequence nodes to obtain a directed acyclic loop; Based on the directed acyclic loop and the scheduling sequence nodes, obtain the scheduling information.

3. The production scheduling method for a bulk cargo terminal according to claim 2, wherein, The step of obtaining the scheduling information based on the directed acyclic loop and the scheduling sequence nodes includes: When the directed acyclic loop is empty, sort the scheduling sequence nodes to obtain the scheduling information.

4. The production scheduling method for the bulk cargo terminal according to claim 2, characterized in that The step of deleting the scheduling sequence nodes of the directed acyclic graph and the directed edges of the scheduling sequence nodes to obtain a directed acyclic loop includes: Determine any node with an in-degree of zero in the directed acyclic graph as a scheduling sequence node; Delete the scheduling sequence node and the out-edges of the scheduling sequence node in the directed acyclic graph to obtain the directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop; Repeat the steps of determining any node with an in-degree of zero in the directed acyclic graph as a scheduling sequence node; deleting the scheduling sequence node and the out-edges of the scheduling sequence node in the directed acyclic graph to obtain the directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there are no nodes with an in-degree of zero in the directed acyclic loop; Determine any node with an out-degree of zero in the directed acyclic graph as the scheduling sequence node; Delete the scheduling sequence node and the in-edges of the scheduling sequence node in the directed acyclic graph to obtain the directed acyclic loop, and update the directed acyclic graph to the directed acyclic loop; Repeat the steps of determining any node with an out-degree of zero in the directed acyclic graph as the scheduling sequence node; deleting the scheduling sequence node and the in-edges of the scheduling sequence node in the directed acyclic graph to obtain the directed acyclic loop, and updating the directed acyclic graph to the directed acyclic loop until there are no nodes with an out-degree of zero in the directed acyclic loop.

5. The production scheduling method for a bulk cargo terminal according to claim 1, characterized in that, The step of obtaining the connection relationship of each node according to the succession relationship rule library includes: Obtain the identification information, equipment process line information, and production resource information of each node; Compare each piece of identification information, each piece of equipment process line information, and each piece of production resource information by using the succession relationship rule library, and obtain the connection relationship of each node according to the comparison result.

6. The production scheduling method of the bulk cargo terminal according to claim 1, characterized in that, The connection relationship also includes an independent relationship, and the method further includes the step of: When the connection relationship of each node is an independent relationship, determine each node as scheduling information and output it.

7. The production scheduling method for a bulk cargo terminal according to any one of claims 1 to 6, characterized in that Include the step of: Perform a dragging process on the nodes of the directed acyclic graph to obtain an updated directed acyclic graph.

8. A production scheduling device for a bulk cargo terminal, characterized in that, Include: A node establishment module for establishing nodes of a directed acyclic graph based on equipment instructions of a bulk cargo terminal; the equipment instructions include identification information of the instructions, equipment process line information, and production resource information; A connection relationship judgment module for obtaining a succession relationship rule library and obtaining the connection relationship of each node according to the succession relationship rule library; the connection relationship includes a succession relationship; wherein, the succession relationship rule library includes any one or a combination of the following: the equipment process line used by the equipment instruction includes duplicate equipment; the equipment instruction occupies the same stack or silo; the equipment instruction occupies the same ship hatch; the spatial positions of the stacker and the reclaimer interfere with each other; the short-distance operation of the stacker and the reclaimer interferes with each other; the same-stack and same-reclaim rule of the stacker and the stacker-reclaimer; the spatial position of the ship loader crosses and interferes with the operation; the short-distance operation of the ship loader interferes with each other; the succession relationship includes a substitution relationship and a continuation relationship; in the continuation relationship, the subsequent instruction waits for the previous instruction to release the equipment before starting to execute, and in the substitution relationship, the subsequent instruction directly replaces the previous instruction, and the previous instruction is completed in advance and releases the equipment for the subsequent instruction to use; A directed edge establishment module, configured to establish directed edges of the directed acyclic graph based on the succession relationship when the connection relationships of the nodes are succession relationships; the directed edges are used to reflect the execution order of the device instructions; A scheduling information acquisition module, configured to directly output the directed acyclic graph to obtain scheduling information when the number of nodes of the directed acyclic graph is less than a preset node number threshold; when the number of nodes of the directed acyclic graph is greater than or equal to the preset node number threshold, perform forward topological sorting and reverse topological sorting on the nodes and directed edges of the directed acyclic graph to obtain scheduling information.

9. A production scheduling device for a bulk cargo terminal, characterized in that, Comprising: A processor, configured to implement the steps of the method according to any one of claims 1 to 7; A display, configured to display the scheduling information.

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 according to any one of claims 1 to 7.

Images