CN109858515A - The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture - Google Patents

The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture Download PDF

Info

Publication number
CN109858515A
CN109858515A CN201811581122.9A CN201811581122A CN109858515A CN 109858515 A CN109858515 A CN 109858515A CN 201811581122 A CN201811581122 A CN 201811581122A CN 109858515 A CN109858515 A CN 109858515A
Authority
CN
China
Prior art keywords
workpiece
central point
technique
new
current
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.)
Pending
Application number
CN201811581122.9A
Other languages
Chinese (zh)
Inventor
胡小建
李伟
陈太湖
张力
彭磊
李晓征
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei University of Technology
Original Assignee
Hefei University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hefei University of Technology filed Critical Hefei University of Technology
Priority to CN201811581122.9A priority Critical patent/CN109858515A/en
Publication of CN109858515A publication Critical patent/CN109858515A/en
Pending legal-status Critical Current

Links

Classifications

    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • General Factory Administration (AREA)

Abstract

本发明实施方式提供一种用于对智能制造的供应链进行订单分批配置的方法及系统,属于数据挖掘技术领域。所述方法包括:获取生产每种工件的工艺,根据预设的工艺集构造工艺信息矩阵;分别计算每两种所述工件的相似性;根据所述相似性构造相似性矩阵;采用K中心点算法对所述相似性矩阵中的所述工件进行聚类运算;根据所述聚类运算的聚类结果调整每种所述工件的生产次序。该方法可以提高工件的生产率。

Embodiments of the present invention provide a method and a system for batch configuration of orders for an intelligent manufacturing supply chain, belonging to the technical field of data mining. The method includes: acquiring a process for producing each kind of workpiece, and constructing a process information matrix according to a preset process set; calculating the similarity of each two kinds of the workpieces respectively; constructing a similarity matrix according to the similarity; using K center point The algorithm performs a clustering operation on the workpieces in the similarity matrix; and adjusts the production order of each of the workpieces according to the clustering result of the clustering operation. The method can improve the productivity of the workpiece.

Description

The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture
Technical field
The present invention relates to data mining technology fields, order more particularly to a kind of supply chain for intelligence manufacture Single method and system configured in batches.
Background technique
With the development of modern logistics and the propulsion of intelligence manufacture, manufacturing enterprise proposes more the responsiveness of supply chain Carry out higher requirement, order management is to provide the important content of responsiveness.For high-end Hydraulic Elements manufacturing industry, order is toward contact Have the characteristics that multiple batches of, small lot, various in style, in face of the increasingly complicated and order of magnanimity, how scientifically to order into Row job-lot control becomes the critical issue that high-end Hydraulic Elements manufacturing enterprise needs to solve.
High-end Hydraulic Elements order has the particularity different from other orders.First, tool is assigned and delivered to order The production cycle of the erratic behavior of having time, Hydraulic Elements is generally longer, and customer demand is generated to order and delivered often because tight Anxious degree difference has the different order delivery times;Second, order volume has fluctuation, and this point has corporate client scale to determine, Due to being customized production, the order demand of size client differs greatly;Third, order kind is complicated, since Hydraulic Elements are related to To the diversity of different model and type part, client is in order to safeguard certain position parts, and product category may be very in order It is complicated.Further, since many components for being related to of Hydraulic Elements have accuracy, can not lengthy warehousing or maintenance cost very Height, also to the responsiveness of order, more stringent requirements are proposed for this.
In the actual production of enterprise, production plan formulate personnel can order according to process, technique, machining accuracy, set Standby requirement, personnel requirement are divided into different batches, help to improve production efficiency by batch production, reduce machine time to wait. However, traditional either inside lacks scientific and reasonable Order Batch method, the personal experience for often relying on formulation personnel is artificial In batches, this batch processes are excessively rough, are inaccurate for the assurance of machine utilization and time-consuming and laborious, so traditional Batch processes urgently improve.
Summary of the invention
The purpose of embodiment of the present invention is to provide a kind of supply chain progress Order Batch configuration for intelligence manufacture Method and system, this method can improve intelligence manufacture supply chain configuration reasonability, improve the production efficiency of element.
To achieve the goals above, embodiment of the present invention provides a kind of supply chain progress order for intelligence manufacture The method configured in batches, which comprises
The technique for obtaining every kind of workpiece of production, according to preset technique collection construction process information matrix;
Calculate separately the similitude of every two kinds of workpiece;
Similarity matrix is constructed according to the similitude;
Cluster operation is carried out to the workpiece in the similarity matrix using K central point (K-Mediods) algorithm;
The production order of every kind of workpiece is adjusted according to the cluster result of the cluster operation.
Optionally, the technique for obtaining every kind of workpiece of production, according to preset technique collection construction process information matrix packet It includes:
The technique information matrix is constructed using formula (1),
Wherein, Tn×mBeing includes the workpiece of n type and the technique information matrix of the m technique, and W is 0 or 1, n For the type of workpiece, m is the quantity of technique.
Optionally, the similitude for calculating separately every two kinds of workpiece includes:
The Euclidean distance of every two kinds of workpiece is calculated according to formula (2),
Wherein, dijFor the Euclidean distance of i-th of workpiece and j-th of workpiece, m is the technique Quantity, WipFor p-th of element in the vector of i-th of workpiece, WjpIt is p-th yuan of the vector of j-th of workpiece Element, Wip、WjpValue be 0 or 1.
Optionally, described to include: according to similitude construction similarity matrix
The similarity matrix is constructed according to formula (3),
Wherein, DnxmFor the similarity matrix.
Optionally, it is described using K central point algorithm to the workpiece in the similarity matrix carry out cluster operation include:
The workpiece of K type of preset quantity is randomly choosed as current central point;
The workpiece for calculating remaining type arrives the Euclidean distance of preset quantity K current central points respectively, respectively Centered on each current central point, preset distance is radius, and the workpiece of all kinds is divided into K current collection It closes;
Calculate separately the central point other workpiece into the current collection of each current collection Europe it is several in Obtain the current summation of distance;
The workpiece of a non-central point is randomly selected in each current collection respectively as new central point;
Respectively centered on each new central point, preset distance is radius, and the workpiece of all kinds is divided into K newly Set;
Calculate separately each new central point into corresponding new set the Euclidean distance of other workpiece it is new Summation;
Judge whether the current summation and the difference of new summation are equal to 0;
In the case where judging the difference not equal to 0, judge whether the difference is greater than 0;
Judge the difference be greater than 0 in the case where, using new central point, new set and new summation as currently in Heart point, current collection and current summation randomly select the work of a non-central point in each current collection respectively again Part is as new central point and executes the corresponding steps of the method, until the difference is equal to 0;
In the case where judging the difference less than 0, one is randomly selected in each current collection respectively again The workpiece of non-central point is as new central point and executes the corresponding steps of the method, until the difference is equal to 0;
In the case where judging that the difference is equal to 0, further judge whether the number of iterations reaches preset times;
In the case where judging that the number of iterations reaches preset times, the current collection is exported to tie as cluster Fruit;
In the case where judging that the number of iterations is not up to preset times, again respectively in each current collection The workpiece of a non-central point is randomly selected as new central point and executes the corresponding steps of the method, until the iteration Number reaches preset times.
Optionally, the method further includes:
The silhouette coefficient of the cluster result is calculated to evaluate the result.
Optionally, the method further includes:
The silhouette coefficient is calculated according to formula (4),
Wherein, Avg (s) is the silhouette coefficient, and n is the quantity of the type of the workpiece, njFor the institute in j-th of set State the quantity of the type of workpiece, sjThe value of the summation for the Euclidean distance gathered for j-th.
What another aspect of the present invention also provided that a kind of supply chain for intelligence manufacture carries out Order Batch configuration is System, the system comprises processor, the processor is used to execute any of the above-described method.
Another aspect of the invention also provides a kind of storage medium, and the storage medium is stored with instruction, and described instruction is used In being read by a machine so that the machine executes any of the above-described method.
Through the above technical solutions, carrying out Order Batch configuration provided by the present invention for the supply chain to intelligence manufacture The production technology of every kind of workpiece is converted to technique information matrix by using preset technique collection by method and system, passes through calculating The Euclidean distance of every two kinds of workpiece simultaneously classifies to every kind of workpiece using K central point algorithm, according to classification results to confession It answers the configuration of chain to be regulated and controled, so that the configuration of supply chain rationalizes, improves the production efficiency of workpiece.
The other feature and advantage of embodiment of the present invention will the following detailed description will be given in the detailed implementation section.
Detailed description of the invention
Attached drawing is to further understand for providing to embodiment of the present invention, and constitute part of specification, with Following specific embodiment is used to explain the present invention embodiment together, but does not constitute the limit to embodiment of the present invention System.In the accompanying drawings:
Fig. 1 is according to embodiment of the present invention for the supply chain progress Order Batch configuration to intelligence manufacture Method flow chart;
Fig. 2 is the flow chart of K central point algorithm according to embodiment of the present invention;And
Fig. 3 is according to embodiment of the present invention for the supply chain progress Order Batch configuration to intelligence manufacture Method flow chart.
Specific embodiment
It is described in detail below in conjunction with specific embodiment of the attached drawing to embodiment of the present invention.It should be understood that Embodiment that the specific embodiments described herein are merely illustrative of the invention is not intended to restrict the invention implementation Mode.
It is according to embodiment of the present invention for the supply chain progress order point to intelligence manufacture as shown in Figure 1 The flow chart of the method for batch configuration.In Fig. 1, this method may include:
In step slo, the technique for obtaining every kind of workpiece of production, according to preset technique collection construction process information matrix. In an example of the invention, with the supply chain data instance of certain company, obtained from the customer order and BOM inventory of the said firm The workpiece of processing in need and all technique (process).Preset technique collection can be the set of all technique.It is right The corresponding element of the technique is preset as 1, at this in the case where a kind of workpiece includes the technique in the technique that technique is concentrated In the case that workpiece does not include the technique, the corresponding element of the technique is preset as 0, to form every kind of (n) workpiece Vector tn=W1,W2,W3,…,Wm.It is technique information matrix that the vector of every kind of workpiece, which is merged into a matrix,.Such as formula (1) institute Show,
Wherein, Tn×mBeing includes the workpiece of n type and the technique information matrix of m technique, and W is 0 or 1, and n is workpiece Type, m are the quantity of technique.
In step s 11, the similitude of every two kinds of workpiece is calculated separately.Taking the above example as an example, due to the work of supply chain Technique involved by part is m.It so can establish the space of m dimension, exist within this space a bit, so that the space Origin be directed toward the point vector it is equal with the vector of workpiece, so that it is empty that the vector of all kinds workpiece is abstracted as m dimension Between multiple points.
In the m-dimensional space, the similitude for calculating the technique of any two kinds of workpiece, which can be, for example to be calculated often according to formula (2) The Euclidean distance of two kinds of workpiece,
Wherein, dijFor the Euclidean distance of i-th of workpiece and j-th of workpiece, m is the quantity of technique, WipIt is i-th P-th of element in the vector of workpiece, WjpFor p-th of element of the vector of j-th of workpiece, Wip、WjpValue be 0 or 1.
In step s 12, similarity matrix is constructed according to similitude.In an example of the invention, based on above-mentioned The Euclidean distance of calculating, the similarity matrix constructed can be as shown in formula (3),
Wherein, DnxmFor similarity matrix, d21、dn1、dn2Etc. all can be calculated Euclidean distance.
In step s 13, cluster fortune is carried out to the workpiece in similarity matrix using K central point (K-Mediods) algorithm It calculates.Taking the above example as an example, in an example of the invention, step S14 may include step as illustrated in FIG. 2.? In Fig. 2, step S14 may include:
In step S20, the workpiece of K type of preset quantity is randomly choosed as current central point;
In the step s 21, calculate remaining type workpiece arrive respectively the Euclids of preset quantity K current central points away from From respectively centered on each current central point, preset distance is radius, and the workpiece of all kinds is divided into K current collection It closes (class in cluster result);
In step S22, the central point of each current collection is calculated separately in the Europe of other workpiece is several into current collection Obtain the current summation of distance;
In step S23, the workpiece of a non-central point is randomly selected in each current collection respectively as in new Heart point;
In step s 24, respectively centered on each new central point, preset distance is radius, by the work of all kinds Part is divided into K new set;
In step s 25, calculate separately each new central point other workpiece into corresponding new set Europe it is several in Obtain the new summation of distance;
In step S26, judge whether current summation and the difference of new summation are equal to 0;
In step s 27, in the case where judging difference not equal to 0, judge whether difference is greater than 0;
In step S28, in the case where judging that difference is greater than 0, new central point, new set and new summation are made For current central point, current collection and current summation, a non-central point is randomly selected in each current collection respectively again Workpiece as new central point and execute method corresponding steps (step S23 to step S26), until the difference be equal to 0;
In the case where judging calculated difference less than 0, one is randomly selected in each current collection respectively again The workpiece of non-central point is as new central point and executes corresponding steps (the step S23 to step S26), until the difference of method Equal to 0;
In step S29, in the case where judging that the difference is equal to 0, further judge whether the number of iterations reaches default Number;
In step s 30, in the case where judging that the number of iterations reaches preset times, output current collection is using as cluster As a result;
In the case where judging that the number of iterations is not up to preset times, randomly selected in each current collection respectively again The workpiece of one non-central point as new central point and execute method corresponding steps (step S23 to step S9), until repeatedly Generation number reaches preset times.
In step S14, the production order of every kind of workpiece is adjusted according to the cluster result of cluster operation.
In an embodiment of the invention, as shown in figure 3, this method can also include step 36.It, should in Fig. 3 Step S36, which can be, calculates the silhouette coefficient of cluster result for example to evaluate cluster result.Specifically, of the invention In one example, step S35, which can be, calculates silhouette coefficient according to formula (4),
Wherein, Avg (s) is silhouette coefficient, and n is the quantity of the type of workpiece, njFor the type of the workpiece in j-th of set Quantity, sjThe value of the summation for the Euclidean distance gathered for j-th.
What another aspect of the present invention also provided that a kind of supply chain for intelligence manufacture carries out Order Batch configuration is Completely, which may include processor, which can be used for executing any of the above-described method.
Another aspect of the invention also provides a kind of storage medium, and storage medium is stored with instruction, instructs for by machine It reads so that machine executes any of the above-described method.
Through the above technical solutions, carrying out Order Batch configuration provided by the present invention for the supply chain to intelligence manufacture The production technology of every kind of workpiece is converted to technique information matrix by using preset technique collection by method and system, passes through calculating The Euclidean distance of every two kinds of workpiece simultaneously classifies to every kind of workpiece using K central point algorithm, according to classification results to confession The configuration of chain is answered to be regulated and controled, it is middle compared with the existing technology to rely on the artificial mode for determining supply chain batch, solve supply chain The low problem of allocative efficiency.
By taking the order of certain model hydraulic pump of the processing of B company as an example, using method provided by the invention to every in order Kind workpiece is clustered.
According to the BOM inventory of certain model hydraulic pump of B company, technique collection includes 35 techniques and workpiece is 71 kinds, according to Above-mentioned data generate the vector t of every kind of workpiecen=W1,W2,W3,…,Wm
The vector of every kind of workpiece is merged by technique information matrix using Java language and MySql database.Technique letter Ceasing matrix can be
After calculating similarity matrix, using K central point algorithm (taking K=10) according to the similarity matrix to the work Part is clustered, and cluster result is as shown in table 1,
Above-mentioned cluster result is analyzed, 71 kinds of workpiece are divided into 10 classes, calculate separately the profile system of 10 classes Number, since the mode of the calculating silhouette coefficient is known to those skilled in the art, details are not described herein again.
According to calculated result it is found that the 1st, 7, the silhouette coefficient values of 9 classes is larger and has significant difference with other classes.With For 1 class, according to BOM inventory it is found that the workpiece of the 1st class is mainly components relevant to axis, the life of each workpiece therein Production. art is close, and production efficiency can be improved to production together in the work piece configuration in the 1st class, saves production cost.Thus may be used See, this method can effectively improve the reasonability of the configuration of supply chain, improve the production efficiency of workpiece.
The optional embodiment of example of the present invention is described in detail in conjunction with attached drawing above, still, embodiment of the present invention is not The detail being limited in above embodiment can be to of the invention real in the range of the technology design of embodiment of the present invention The technical solution for applying mode carries out a variety of simple variants, these simple variants belong to the protection scope of embodiment of the present invention.
It is further to note that specific technical features described in the above specific embodiments, in not lance In the case where shield, it can be combined in any appropriate way.In order to avoid unnecessary repetition, embodiment of the present invention To various combinations of possible ways, no further explanation will be given.
It will be appreciated by those skilled in the art that realizing that all or part of the steps in above embodiment method is can to lead to Program is crossed to instruct relevant hardware and complete, which is stored in a storage medium, including some instructions use so that One (can be single-chip microcontroller, chip etc.) or processor (processor) execute each embodiment the method for the application All or part of the steps.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey The medium of sequence code.
In addition, any combination can also be carried out between a variety of different embodiments of embodiment of the present invention, as long as its Without prejudice to the thought of embodiment of the present invention, embodiment of the present invention disclosure of that equally should be considered as.

Claims (8)

1. a kind of method that the supply chain for intelligence manufacture carries out Order Batch configuration, which is characterized in that the method packet It includes:
The technique for obtaining every kind of workpiece of production, according to preset technique collection construction process information matrix;
Calculate separately the similitude of every two kinds of workpiece;
Similarity matrix is constructed according to the similitude;
Cluster operation is carried out to the workpiece in the similarity matrix using K central point algorithm;
The production order of every kind of workpiece is adjusted according to the cluster result of the cluster operation.
2. the method according to claim 1, wherein described obtain the technique for producing every kind of workpiece, according to default Technique collection construction process information matrix include:
The technique information matrix is constructed using formula (1),
Wherein, Tn×mBeing includes the workpiece of n type and the technique information matrix of the m technique, and W is 0 or 1, and n is work The type of part, m are the quantity of technique.
3. according to the method described in claim 2, it is characterized in that, the similitude packet for calculating separately every two kinds of workpiece It includes:
The Euclidean distance of every two kinds of workpiece is calculated according to formula (2),
Wherein, dijFor the Euclidean distance of i-th of workpiece and j-th of workpiece, m is the number of the technique Amount, WipFor p-th of element in the vector of i-th of workpiece, WjpFor p-th of element of the vector of j-th of workpiece, Wip、WjpValue be 0 or 1.
4. according to the method described in claim 3, it is characterized in that, described construct similarity matrix packet according to the similitude It includes:
The similarity matrix is constructed according to formula (3),
Wherein, DnxmFor the similarity matrix.
5. the method according to claim 1, wherein described use K central point algorithm to the similarity matrix In workpiece carry out cluster operation include:
The workpiece of K type of preset quantity is randomly choosed as current central point;
The workpiece for calculating remaining type arrives the Euclidean distance of preset quantity K current central points respectively, respectively with every Centered on a current central point, preset distance is radius, and the workpiece of all kinds is divided into K current collection;
Calculate separately the Euclids of the central point other workpiece into the current collection of each current collection away from From current summation;
The workpiece of a non-central point is randomly selected in each current collection respectively as new central point;
Respectively centered on each new central point, preset distance is radius, and the workpiece of all kinds is divided into K new collection It closes;
Calculate separately the new summation of each new central point Euclidean distance of other workpiece into corresponding new set;
Judge whether the current summation and the difference of new summation are equal to 0;
In the case where judging the difference not equal to 0, judge whether the difference is greater than 0;
In the case where judging that the difference is greater than 0, using new central point, new set and new summation as current center Point, current collection and current summation randomly select the workpiece of a non-central point in each current collection respectively again As new central point and the corresponding steps of the method are executed, until the difference is equal to 0;
In the case where judging the difference less than 0, randomly selected in each current collection respectively again one it is non-in The workpiece of heart point is as new central point and executes the corresponding steps of the method, until the difference is equal to 0;
In the case where judging that the difference is equal to 0, further judge whether the number of iterations reaches preset times;
In the case where judging that the number of iterations reaches preset times, the current collection is exported using as cluster result;
It is random in each current collection respectively again in the case where judging that the number of iterations is not up to preset times The workpiece of a non-central point is chosen as new central point and executes the corresponding steps of the method, until the number of iterations Reach preset times.
6. the method according to claim 1, wherein the method further includes:
The silhouette coefficient of the cluster result is calculated to evaluate the result.
7. according to the method described in claim 6, it is characterized in that, the method further includes:
The silhouette coefficient is calculated according to formula (4),
Wherein, Avg (s) is the silhouette coefficient, and n is the quantity of the type of the workpiece, njFor the work in j-th of set The quantity of the type of part, sjThe value of the summation for the Euclidean distance gathered for j-th.
8. a kind of system that the supply chain for intelligence manufacture carries out Order Batch configuration, which is characterized in that the system packet Processor is included, the processor requires 1 to 7 any method for perform claim.
CN201811581122.9A 2018-12-24 2018-12-24 The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture Pending CN109858515A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811581122.9A CN109858515A (en) 2018-12-24 2018-12-24 The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811581122.9A CN109858515A (en) 2018-12-24 2018-12-24 The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture

Publications (1)

Publication Number Publication Date
CN109858515A true CN109858515A (en) 2019-06-07

Family

ID=66892043

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811581122.9A Pending CN109858515A (en) 2018-12-24 2018-12-24 The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture

Country Status (1)

Country Link
CN (1) CN109858515A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111860680A (en) * 2020-07-29 2020-10-30 哈尔滨理工大学 A Workpiece Clustering Method Based on K-means Algorithm
CN117252372A (en) * 2023-09-22 2023-12-19 国网新疆电力有限公司营销服务中心(资金集约中心、计量中心) Industrial Internet resource allocation and scheduling method based on cluster analysis algorithm

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101216710A (en) * 2007-12-28 2008-07-09 东南大学 A Self-Adaptive Selection and Dynamic Production Scheduling Control System Realized by Computer
CN101788819A (en) * 2010-03-08 2010-07-28 清华大学 Dispatching method based on iterative decomposition and flow relaxation in large-scale production process
CN107273650A (en) * 2017-08-21 2017-10-20 江南大学 Typical process route extracting method based on coordinate representation
CN107862411A (en) * 2017-11-09 2018-03-30 西南交通大学 A kind of extensive flexible job shop scheduling optimization method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101216710A (en) * 2007-12-28 2008-07-09 东南大学 A Self-Adaptive Selection and Dynamic Production Scheduling Control System Realized by Computer
CN101788819A (en) * 2010-03-08 2010-07-28 清华大学 Dispatching method based on iterative decomposition and flow relaxation in large-scale production process
CN107273650A (en) * 2017-08-21 2017-10-20 江南大学 Typical process route extracting method based on coordinate representation
CN107862411A (en) * 2017-11-09 2018-03-30 西南交通大学 A kind of extensive flexible job shop scheduling optimization method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈太湖,胡小建,李晓征,纪中丽: "基于K-Mediods聚类方法的液压元件加工车间工件分批方法研究", 《中国管理学》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111860680A (en) * 2020-07-29 2020-10-30 哈尔滨理工大学 A Workpiece Clustering Method Based on K-means Algorithm
CN117252372A (en) * 2023-09-22 2023-12-19 国网新疆电力有限公司营销服务中心(资金集约中心、计量中心) Industrial Internet resource allocation and scheduling method based on cluster analysis algorithm

Similar Documents

Publication Publication Date Title
CN106293891B (en) Multidimensional investment index monitoring method
JP6694447B2 (en) Big data calculation method and system, program, and recording medium
CN106649503A (en) Query method and system based on sql
CN111382347A (en) Object feature processing and information pushing method, device and equipment
CN109858515A (en) The method and system of Order Batch configuration are carried out for the supply chain to intelligence manufacture
CN105654187A (en) Grid binary tree method of control system midpoint locating method
CN118733006B (en) Script file generation method, task processing method and electronic device
CN114881301A (en) Production line simulation scheduling method, system, terminal equipment and storage medium
Zhu et al. Classytune: A performance auto-tuner for systems in the cloud
CN117707078A (en) Semiconductor encapsulation bonding process quick response scheduling method and system based on hyper heuristic algorithm
CN116560984A (en) Test case clustering grouping method based on call dependency graph
CN117234251A (en) Electrical appliance pressure control method and system based on artificial intelligence
CN111613273A (en) Model training method, protein interaction prediction method, device and medium
CN112070200B (en) Harmonic group optimization method and application thereof
CN104570759B (en) The quick Binomial Trees of control system midpoint orientation problem
CN117951271A (en) Data analysis method, device, computer equipment and computer readable storage medium
Kontolatis et al. Optimisation of press-brake bending operations in 3D space
CN114116456B (en) Test case generation method, system and computer readable storage medium
Maudet et al. Search strategy generation for branch and bound using genetic programming
AU2020103440A4 (en) A method for optimizing the convergence performance of data learning with minimal computational steps
CN115906794A (en) Cold-chain logistics business report generation method and device, electronic equipment and storage medium
CN114092313A (en) Model reasoning acceleration method and system based on GPU (graphics processing Unit) equipment
CN113778518A (en) Data processing method, data processing device, computer equipment and storage medium
CN118410992B (en) Flexible job shop scheduling method, system, medium and equipment
KR102185980B1 (en) Table processing method and apparatus

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20190607

RJ01 Rejection of invention patent application after publication