CN112085591B - Visual arrangement method for running batch at bank based on graph theory - Google Patents
Visual arrangement method for running batch at bank based on graph theory Download PDFInfo
- Publication number
- CN112085591B CN112085591B CN202010917779.9A CN202010917779A CN112085591B CN 112085591 B CN112085591 B CN 112085591B CN 202010917779 A CN202010917779 A CN 202010917779A CN 112085591 B CN112085591 B CN 112085591B
- Authority
- CN
- China
- Prior art keywords
- job
- nodes
- node
- running
- mode
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000000007 visual effect Effects 0.000 title claims description 14
- 230000001419 dependent effect Effects 0.000 claims description 7
- 238000005457 optimization Methods 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 abstract description 3
- 238000012163 sequencing technique Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention discloses a visualized arrangement method of running lot at bank based on graph theory, comprising the following steps: selecting different job scheduling modes, wherein the job scheduling modes include a timing mode, a periodic mode and a calendar mode; judging whether a calendar mode is selected; if the calendar mode is not selected, acquiring different running batch systems and work nodes which are not arranged under the agents associated with the different running batch systems through an API interface; forming a complete job scheduling chain according to the service logic; judging the connection line of the operation nodes according to the service requirement, and optimizing the operation nodes by traversing a recursion algorithm to form a directed acyclic graph among the operation nodes; all the job nodes are stored in the form of job flow and displayed in the job flow list interface. Through the mode, the visualized arrangement method of the running lot at the bank based on the graph theory disclosed by the invention can automatically, sequentially and simply realize the problem of running lot processing of the bank, and greatly improve the running lot processing efficiency.
Description
Technical Field
The invention relates to the technical field of Internet, in particular to a visual arrangement method for running lots at banks based on graph theory.
Background
Along with the rapid development of information technology, informatization becomes an important path for bank development. Statement is a powerful means of bank data arrangement, formatting and data presentation. Report generation by batch jobs is currently the mainstream. However, with the rapid advancement of globalization of banking, more overseas branches mean that the number of banking systems and the operation scale are continuously expanding. Scheduling report batch jobs faces challenges brought by overseas branches, multiple time zones, different business hours, different business requirements, different dependence on system data, and the like.
At present, the problem of bank batch processing has larger defects and complicated sequence, so that the batch processing efficiency is low, therefore, the technical means is utilized effectively to fully utilize system resources, the problems of simplified dispatching, low cost and the need of coordinating each branch batch operation become the problem to be solved by the globalization bank report system.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a visual arrangement method of running batches in banks based on graph theory, which can automatically, sequentially and simply realize the running batch processing problem of banks and greatly improve the running batch processing efficiency.
In order to solve the technical problems, the invention adopts a technical scheme that: the visual arrangement method for running lots at banks based on graph theory is characterized by comprising the following steps: selecting different job scheduling modes, wherein the job scheduling modes include a timing mode, a period mode and a calendar mode; judging whether a calendar mode is selected; if the calendar mode is not selected, acquiring different running batch systems and work nodes which are not arranged under the agents associated with the different running batch systems through an API interface; forming a complete job scheduling chain according to the service logic; judging the connection line of the operation nodes according to the service requirement, and optimizing the operation nodes by traversing a recursion algorithm to form a directed acyclic graph among the operation nodes; all the job nodes are stored in the form of job flow and displayed in the job flow list interface.
Further, the method further comprises: the orchestrated job nodes are identified and the newly added job flow is presented in an orchestrated job area of the job flow list interface.
Further, the method further comprises: in the next job flow arrangement, the arranged job node or job flow is used as a front-end dependent node of a certain job node, wherein the certain job node and the arranged job node are not in the same job flow arrangement.
Further, the step of connecting the complete job scheduling chain according to the business logic comprises the following steps: and connecting every two adjacent job nodes in the job nodes which are not arranged according to the service logic to form a job scheduling chain.
Further, the step of judging the connection line of the operation node according to the service requirement includes: judging whether the connection line of the operation node in the operation scheduling chain has the phenomena of connection line crossing, overlapping or jerking.
Further, the step of optimizing the operation node by traversing the recursive algorithm includes: finding an end node in the job flow, traversing forward from the end node to find a longest edge; performing hierarchical distribution on all the operation nodes, and performing hierarchical connection to enable the operation nodes of adjacent layers to be connected with each other; sorting the inner vertexes of the layers, inserting virtual nodes among the nodes of the same layer, directionally connecting the operation nodes of adjacent layers, judging the number of intersections of every two links of the operation nodes of the adjacent layers, comparing the number of intersections until the minimum number of intersections is found, and exchanging positions of the nodes of the same layer; and deleting the virtual nodes, and distributing coordinate values to all the operation nodes according to the calculated sorting order.
Further, the method further comprises: if it is determined that the calendar mode is selected, the pre-dependency node is added and the step of saving all the job nodes in the form of job streams and showing them in the job stream list interface is performed.
Further, the method further comprises: importing a workflow in the form of a file; and optimizing the operation nodes in the operation flow through a traversal recursion algorithm so as to form a directed acyclic graph among the operation nodes.
Further, the method further comprises: in calendar mode, selecting the node of the arranged job flow or a certain node in the job flow as a pre-arranged dependent node, dragging the node into the canvas, and clicking a one-key typesetting button on the canvas so as to realize the optimization of node layout through the typesetting button.
The beneficial effects of the invention are as follows: different from the prior art, the visual arrangement method based on graph theory in bank running batch disclosed by the invention comprises the following steps: selecting different job scheduling modes, wherein the job scheduling modes include a timing mode, a periodic mode and a calendar mode; judging whether a calendar mode is selected; if the calendar mode is not selected, acquiring different running batch systems and work nodes which are not arranged under the agents associated with the different running batch systems through an API interface; forming a complete job scheduling chain according to the service logic; judging the connection line of the operation nodes according to the service requirement, and optimizing the operation nodes by traversing a recursion algorithm to form a directed acyclic graph among the operation nodes; all the job nodes are stored in the form of job flow and displayed in the job flow list interface. Through the mode, the visualized arrangement method of the running lot at the bank based on the graph theory disclosed by the invention can automatically, sequentially and simply realize the problem of running lot processing of the bank, and greatly improve the running lot processing efficiency.
Drawings
FIG. 1 is a flow chart of a visual arrangement method of running lots at a bank based on graph theory;
fig. 2 is a schematic flow chart of the substeps of step S105 in fig. 1.
Detailed Description
The present invention will be described in detail with reference to the drawings and embodiments.
As shown in fig. 1, the visual arrangement method of the running lot at the bank based on the graph theory comprises the following steps:
step S101: different job scheduling modes are selected. Wherein the job scheduling modes include a timing mode, a period mode, and a calendar mode.
Step S102: it is determined whether a calendar mode is selected.
Step S103: if the calendar mode is not selected, acquiring the work nodes which are not arranged under different running batch systems and agents associated with the different running batch systems through an API interface. It should be understood that the job node represents a bank run-to-run process or a bank run-to-run process.
Step S104: and forming a complete job scheduling chain according to the service logic. It should be appreciated that business logic is set for the user, while job scheduling chains equate to job flows.
It should be appreciated that in this embodiment, the steps of connecting into a complete job scheduling chain according to the business logic include: and connecting every two adjacent job nodes in the job nodes which are not arranged according to the service logic to form a job scheduling chain.
Step S105: and judging the connection line of the operation nodes according to the service requirement, and optimizing the operation nodes by traversing a recursion algorithm to form a directed acyclic graph among the operation nodes.
It should be understood that, in this embodiment, the step of determining the connection line of the operation node according to the service requirement includes: judging whether the connection line of the operation node in the operation scheduling chain has the phenomena of connection line crossing, overlapping or jerking. It should be noted that if the connection lines in the operation node have the phenomena of intersection, overlapping or jerking of the connection lines, the workload of the batch running process of the bank is seriously affected, and the working efficiency is affected.
As shown in fig. 2, the step of optimizing the job node by traversing the recursive algorithm includes:
step S1051: find the end node in the job flow, start from end node, go forward, in order to find a longest edge.
It should be appreciated that each job scheduling chain has a start job node and an end job node.
Step S1052: and performing hierarchical distribution on all the operation nodes, and performing hierarchical connection so that the operation nodes of adjacent layers are connected with each other. It should be understood that the tiers are hierarchically divided, i.e., the tiers are hierarchically oriented, such as the highest tier is connected to the lowest tier, and the start job node may be the highest tier and the end job node the lowest tier, as desired.
Step S1053: and sequencing the inner vertexes of the layers, inserting virtual nodes among the nodes of the same layer, directionally connecting the operation nodes of the adjacent layers, judging the number of intersections of every two links of the operation nodes of the adjacent layers, comparing the number of intersections, and exchanging positions of the nodes of the same layer after the minimum number of intersections is found.
It should be understood that the virtual node is used to solve the problem of wire crossing, so that the minimum value of the number of wire crossings can be conveniently found, and the minimum value can be deleted after the wire crossings are arranged. Further, the vertex of each level may be used as the operation node corresponding to each level, that is, the trend (the direction of connection) of the adjacent level is directional, such as only going from the highest level to the lowest value.
Step S1054: and deleting the virtual nodes, and distributing coordinate values to all the operation nodes according to the calculated sorting order. It should be appreciated that the job nodes are presented in the job flow list interface in the form of a job flow, and therefore, it is necessary to assign coordinates at the job flow list interface to all the job nodes, and the coordinates of each job node are different, so that the job nodes can be displayed in order.
Step S106: all the job nodes are stored in the form of job flow and displayed in the job flow list interface.
Further, in this embodiment, the method for visually arranging a running lot at a bank based on graph theory further includes: the orchestrated job nodes are identified and the newly added job flow is presented in an orchestrated job area of the job flow list interface.
Further, in this embodiment, the method for visually arranging a running lot at a bank based on graph theory further includes: in the next job flow arrangement, the arranged job node or job flow is used as a front-end dependent node of a certain job node, wherein the certain job node and the arranged job node are not in the same job flow arrangement. It should be understood that the above steps S101, S102, S103, S104, S105, and S106 are in the same workflow schedule, so in the next workflow schedule, the scheduled job node or the workflow is regarded as the pre-dependent node of a certain job node.
Further, in this embodiment, the method for visually arranging a running lot at a bank based on graph theory further includes: if it is determined that the calendar mode is selected, the pre-dependency node is added and the step of saving all the job nodes in the form of job streams and showing them in the job stream list interface is performed.
Further, in this embodiment, the method for visually arranging a running lot at a bank based on graph theory further includes:
step A1: the job stream is imported in the form of a file. It should be understood that the job node imported into the job flow in the form of a file does not include coordinates, and if the job node is displayed on the job flow list interface, it will be seen that there is a phenomenon that the job node overlaps, the connection lines between the nodes cross or makes a sharp turn, so that the coordinates on the job flow list interface need to be allocated to the job node in the job flow.
Step A2: and optimizing the operation nodes in the operation flow through a traversal recursion algorithm so as to form a directed acyclic graph among the operation nodes.
It should be understood that the specific manner of step A2 is:
step A21: an ending job node in the job flow is found and traversed from back to front. It should be appreciated that each job flow has a start job node and an end job node.
Step A22: and performing hierarchical distribution on all the operation nodes in the operation flow, and performing hierarchical connection so that the operation nodes of adjacent layers are connected with each other. It should be understood that the tiers are hierarchically divided, i.e., the tiers are hierarchically oriented, such as the highest tier is connected to the lowest tier, and the start job node may be the highest tier and the end job node the lowest tier, as desired.
Step A23: and sequencing the inner vertexes of the layers, inserting virtual nodes among the nodes of the same layer, directionally connecting the operation nodes of the adjacent layers, judging the number of intersections of every two links of the operation nodes of the adjacent layers, comparing the number of intersections, and exchanging positions of the nodes of the same layer after the minimum number of intersections is found. It should be appreciated that the vertices of each level may serve as the job nodes to which each level corresponds. That is, the trend (wiring direction) of the adjacent hierarchy is directional, such as only the lowest price can be moved from the highest level.
Step A24: and deleting the virtual nodes, and distributing coordinate values to all the operation nodes in the operation flow according to the calculated sorting order. It should be appreciated that the job nodes are presented in the job flow list interface in the form of a job flow, and therefore, it is necessary to assign coordinates at the job flow list interface to all the job nodes so that the job nodes can be displayed in order.
Step A25: and displaying the workflow in the workflow list interface according to the coordinate values. It should be appreciated that the coordinates of each job node of the job flow are different.
Further, in this embodiment, the method for visually arranging a running lot at a bank based on graph theory further includes: in calendar mode, selecting the node of the arranged job flow or a certain node in the job flow as a pre-arranged dependent node, dragging the node into the canvas, and clicking a one-key typesetting button on the canvas so as to realize the optimization of node layout through the typesetting button.
In summary, the visual arrangement method based on graph theory for running in banks disclosed by the invention comprises the following steps: selecting different job scheduling modes, wherein the job scheduling modes include a timing mode, a periodic mode and a calendar mode; judging whether a calendar mode is selected; if the calendar mode is not selected, acquiring different running batch systems and work nodes which are not arranged under the agents associated with the different running batch systems through an API interface; forming a complete job scheduling chain according to the service logic; judging the connection line of the operation nodes according to the service requirement, and optimizing the operation nodes by traversing a recursion algorithm to form a directed acyclic graph among the operation nodes; all the job nodes are stored in the form of job flow and displayed in the job flow list interface. Through the mode, the visualized arrangement method of the running lot at the bank based on the graph theory disclosed by the invention can automatically, sequentially and simply realize the problem of running lot processing of the bank, and greatly improve the running lot processing efficiency.
The foregoing description is only illustrative of the present invention and is not intended to limit the scope of the invention, and all equivalent structures or equivalent processes or direct or indirect application in other related technical fields are included in the scope of the present invention.
Claims (5)
1. A visual arrangement method of running lot at bank based on graph theory is characterized by comprising the following steps:
selecting different job scheduling modes, wherein the job scheduling modes include a timing mode, a period mode and a calendar mode;
judging whether a calendar mode is selected;
if the calendar mode is not selected, acquiring different running batch systems and work nodes which are not arranged under the agents associated with the different running batch systems through an API interface;
forming a complete job scheduling chain according to the service logic;
judging the connection line of the operation nodes according to the service requirement, and optimizing the operation nodes by traversing a recursion algorithm to form a directed acyclic graph among the operation nodes;
storing all the operation nodes in the form of operation flow, and displaying in an operation flow list interface;
the step of connecting the complete job scheduling chain according to the service logic comprises the following steps:
according to the business logic, every two adjacent job nodes in the job nodes which are not arranged are connected with each other to form a job scheduling chain;
the step of judging the connection line of the operation node according to the service requirement comprises the following steps:
judging whether the connecting lines of the operation nodes in the operation scheduling chain have the phenomena of crossing, overlapping or jerking;
the step of optimizing the operation node by traversing the recursive algorithm comprises the following steps:
finding an end node in the job flow, traversing forward from the end node to find a longest edge;
performing hierarchical distribution on all the operation nodes, and performing hierarchical connection to enable the operation nodes of adjacent layers to be connected with each other;
sorting the inner vertexes of the layers, inserting virtual nodes among the nodes of the same layer, directionally connecting the operation nodes of adjacent layers, judging the number of intersections of every two links of the operation nodes of the adjacent layers, comparing the number of intersections until the minimum number of intersections is found, and exchanging positions of the nodes of the same layer;
deleting the virtual nodes, and distributing coordinate values to all the operation nodes according to the calculated sorting order;
the method further comprises the steps of:
if it is determined that the calendar mode is selected, the pre-dependency node is added and the step of saving all the job nodes in the form of job streams and showing them in the job stream list interface is performed.
2. The method for visual orchestration of a running block at a bank based on graph theory according to claim 1, wherein the method further comprises:
the orchestrated job nodes are identified and the newly added job flow is presented in an orchestrated job area of the job flow list interface.
3. The method for visual orchestration of a running block at a bank based on graph theory according to claim 2, wherein the method further comprises:
in the next job flow arrangement, the arranged job node or job flow is used as a front-end dependent node of a certain job node, wherein the certain job node and the arranged job node are not in the same job flow arrangement.
4. The method for visual orchestration of a running block at a bank based on graph theory according to claim 1, wherein the method further comprises:
importing a workflow in the form of a file;
and optimizing the operation nodes in the operation flow through a traversal recursion algorithm so as to form a directed acyclic graph among the operation nodes.
5. The method for visual orchestration of a running block at a bank based on graph theory according to claim 1, wherein the method further comprises:
in calendar mode, selecting the node of the arranged job flow or a certain node in the job flow as a pre-arranged dependent node, dragging the node into the canvas, and clicking a one-key typesetting button on the canvas so as to realize the optimization of node layout through the typesetting button.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010917779.9A CN112085591B (en) | 2020-09-03 | 2020-09-03 | Visual arrangement method for running batch at bank based on graph theory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010917779.9A CN112085591B (en) | 2020-09-03 | 2020-09-03 | Visual arrangement method for running batch at bank based on graph theory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112085591A CN112085591A (en) | 2020-12-15 |
| CN112085591B true CN112085591B (en) | 2023-11-07 |
Family
ID=73731652
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010917779.9A Active CN112085591B (en) | 2020-09-03 | 2020-09-03 | Visual arrangement method for running batch at bank based on graph theory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112085591B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0863432A (en) * | 1994-08-22 | 1996-03-08 | Nec Corp | Actuation scheduling system of message batch processing system |
| WO2007071984A2 (en) * | 2005-12-19 | 2007-06-28 | Misys Plc | Method and system for running a batch process |
| CN105677465A (en) * | 2015-12-31 | 2016-06-15 | 中国建设银行股份有限公司 | Data processing method and device applied to bank batch processing |
| KR20170078098A (en) * | 2015-12-29 | 2017-07-07 | 홍수민 | Bank Information System |
| CN109634561A (en) * | 2018-10-16 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of online visual programming method and device |
| CN110717076A (en) * | 2019-09-06 | 2020-01-21 | 平安科技（深圳）有限公司 | Node management method, node management device, computer equipment and storage medium |
| CN111147555A (en) * | 2019-12-13 | 2020-05-12 | 苏州博纳讯动软件有限公司 | Heterogeneous resource mixed arrangement method |
| CN111142867A (en) * | 2019-12-31 | 2020-05-12 | 谷云科技(广州)有限责任公司 | Service visual arrangement system and method under micro-service architecture |
| CN111160873A (en) * | 2019-12-31 | 2020-05-15 | 中国银行股份有限公司 | Batch processing device and method based on distributed architecture |
-
2020
- 2020-09-03 CN CN202010917779.9A patent/CN112085591B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0863432A (en) * | 1994-08-22 | 1996-03-08 | Nec Corp | Actuation scheduling system of message batch processing system |
| WO2007071984A2 (en) * | 2005-12-19 | 2007-06-28 | Misys Plc | Method and system for running a batch process |
| KR20170078098A (en) * | 2015-12-29 | 2017-07-07 | 홍수민 | Bank Information System |
| CN105677465A (en) * | 2015-12-31 | 2016-06-15 | 中国建设银行股份有限公司 | Data processing method and device applied to bank batch processing |
| CN109634561A (en) * | 2018-10-16 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of online visual programming method and device |
| CN110717076A (en) * | 2019-09-06 | 2020-01-21 | 平安科技（深圳）有限公司 | Node management method, node management device, computer equipment and storage medium |
| CN111147555A (en) * | 2019-12-13 | 2020-05-12 | 苏州博纳讯动软件有限公司 | Heterogeneous resource mixed arrangement method |
| CN111142867A (en) * | 2019-12-31 | 2020-05-12 | 谷云科技(广州)有限责任公司 | Service visual arrangement system and method under micro-service architecture |
| CN111160873A (en) * | 2019-12-31 | 2020-05-15 | 中国银行股份有限公司 | Batch processing device and method based on distributed architecture |
Non-Patent Citations (1)
| Title |
|---|
| 基于多分支、多环节银行业务流程的场景测试方法探索;中国农业银行测试研究组;金融电子化(08);第67-69页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112085591A (en) | 2020-12-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7065634B2 (en) | Methods and systems for developing data flow programs | |
| MXPA01002771A (en) | Computer-implemented product development planning method. | |
| Aggoune et al. | Flow shop scheduling problem with limited machine availability: A heuristic approach | |
| CN105373909A (en) | Logistics dispensing center addressing method based on simulation software | |
| CN104063559A (en) | Layout legalization method and system for distributed computing of large-scale integrated circuit | |
| CN108121863A (en) | Creation method, device, equipment and the computer readable storage medium of pipeline label | |
| JP2011170496A (en) | Device and method for supporting plant construction plan | |
| CN107831740A (en) | A kind of Optimization Scheduling during the distributed manufacturing applied to notebook part | |
| Zhang | Repetitive project scheduling: Theory and methods | |
| Li | Research on discrete intelligent workshop lot-streaming scheduling with variable sublots under engineer to order | |
| Jong et al. | The multi-layered job-shop automatic scheduling system of mould manufacturing for Industry 3.5 | |
| WO2008021400A9 (en) | Dynamic value stream mapping software | |
| CN112085591B (en) | Visual arrangement method for running batch at bank based on graph theory | |
| Grobler-Debska et al. | Idea of switching algebraic-logical models in flow-shop scheduling problem with defects | |
| Gong et al. | Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility | |
| Queirolo et al. | Warehouse layout design: minimizing travel time with a genetic and simulative approach—methodology and case study | |
| Wang et al. | Modeling and analysis for multi-period, multi-product and multi-resource production scheduling | |
| Shah et al. | New modeling and performance evaluation of tool sharing control in FMS using colored Petri nets | |
| CN102609554A (en) | Computer-aided design method and device for large LED (light-emitting diode) screens | |
| CN107122849B (en) | Spark R-based product detection total completion time minimization method | |
| Chen et al. | Adaptive scheduling and tool flow control in flexible job shops | |
| JP3394024B2 (en) | Device placement device and device placement design method | |
| Wu et al. | An improved genetic-shuffled frog-leaping algorithm for permutation flowshop scheduling | |
| Alaoui et al. | Interactive Scheduling Decision Support System for ore extraction at a phosphate mine | |
| TWM611985U (en) | Optimization system for metal processing production scheduling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |