CN117314142B - Product line process sequence optimization method - Google Patents
Product line process sequence optimization method Download PDFInfo
- Publication number
- CN117314142B CN117314142B CN202311197289.6A CN202311197289A CN117314142B CN 117314142 B CN117314142 B CN 117314142B CN 202311197289 A CN202311197289 A CN 202311197289A CN 117314142 B CN117314142 B CN 117314142B
- Authority
- CN
- China
- Prior art keywords
- component
- processing
- product line
- array
- efficiency
- 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 97
- 238000005457 optimization Methods 0.000 title claims description 11
- 238000012545 processing Methods 0.000 claims abstract description 42
- 238000012163 sequencing technique Methods 0.000 claims abstract description 11
- 230000005587 bubbling Effects 0.000 claims abstract description 9
- 238000012423 maintenance Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000011156 evaluation Methods 0.000 claims description 5
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000004088 simulation Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000004075 alteration Effects 0.000 description 2
- 230000008094 contradictory effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007689 inspection Methods 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
- 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/0633—Workflow analysis
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- General Factory Administration (AREA)
Abstract
The invention provides a method for optimizing the sequence of working procedures of a product line, which comprises the following steps: step 1, initializing a process sequence array of a product line, and step 2, extracting two part numbers G and H adjacent to each other in front and back in the process sequence array; step 3, calculating the efficiency p1 of the first processing part G and then the processing part H, and calculating the efficiency p2 of the first processing part H and then the processing part G; step 4, if p1 is less than p2, the positions of the part number G and the part number H are interchanged; and step 5, executing the step 2 to the step 4 on the part numbers in the process sequence array based on the bubbling sequencing method to obtain the sequenced process sequence array. The invention adopts the bubbling sequencing method to reorder the component numbers in the sequence order array, the sequencing basis is to process the efficiency of the components according to different sequences, adjust the processing sequences of the different components according to the sequence with high efficiency, optimize the sequence of the product line, and achieve the purpose of automatically optimizing the product line sequence.
Description
Technical Field
The invention relates to the field of product line optimization, in particular to a product line process sequence optimization method.
Background
Fig. 1 is a common product line format. If the device is used for product overhaul, the process A1 is the disassembly part A, the process A2 is the overhaul part A, the process B1 is the disassembly part B, the process B2 is the overhaul part B, and so on, and after all the parts are overhauled, the device enters the final process assembly X. The order of disassembly of the components typically has a significant impact on whether such product lines can operate efficiently.
The main difficulties faced in optimizing the sequence of the process are: first, there is uncertainty in the time taken to complete each process. The working content of each process is determined when the product line is actually operated, but the working time of each process is not determined due to the occurrence of accidents, such as the occurrence of a fault that a certain part is difficult to process, the failure of timely delivering the spare materials required by a certain process, the temporary drawing of part of personnel to other posts and the like. Secondly, the time consumption of each process is not independent and is related, and once the number of the processes is large (more than 5), the time consumption is too long to theoretically evaluate the capacity of a product line after changing the process sequence, and therefore, the process sequence is difficult to optimize by using conventional methods such as a traversing method. At present, the work of optimizing the product line is mainly carried out by depending on the experience of field technicians of the product line, and an effective and more universal product line process optimizing method is lacked.
Disclosure of Invention
Aiming at the technical problems in the prior art, the invention provides a method for optimizing the sequence of the working procedures of a product line, which comprises the following steps:
Step 1, initializing a process sequence array of a product line, wherein part numbers are stored in the process sequence array, the product line comprises n+1 processes, the first n processes are for disassembling and overhauling n parts, and the disassembling time and the overhauling time of each part are respectively subjected to normal distribution;
step2, extracting two adjacent part numbers G and H from the sequence array;
Step 3, calculating the efficiency p1 of processing the component G before processing the component H and the efficiency p2 of processing the component H before processing the component G based on the normal distribution obeyed by the disassembling time and the maintenance time of the components G and H;
step 4, if p1 is less than p2, exchanging the positions of the part number G and the part number H in the process sequence array;
And 5, executing the steps 2 to 4 on the part numbers in the sequence order array based on the bubbling sequencing method to obtain the sequenced sequence order array, namely the optimized product line sequence.
The invention provides a method for optimizing the working procedure sequence of a product line, which adopts an bubbling sequencing method to reorder the component numbers in a working procedure sequence array, wherein the sequencing basis is to process the efficiency of components according to different sequences, adjust the processing sequences of the different components according to the sequence with high efficiency, optimize the working procedure of the product line, and achieve the aim of automatically optimizing the working procedure of the product line.
Drawings
FIG. 1 is a schematic diagram of a conventional product line format;
FIG. 2 is a schematic flow chart of a process sequence optimization method for a product line according to the present invention;
Fig. 3 is a schematic diagram of simulation results.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention. In addition, the technical features of each embodiment or the single embodiment provided by the invention can be combined with each other at will to form a feasible technical scheme, and the combination is not limited by the sequence of steps and/or the structural composition mode, but is necessarily based on the fact that a person of ordinary skill in the art can realize the combination, and when the technical scheme is contradictory or can not realize, the combination of the technical scheme is not considered to exist and is not within the protection scope of the invention claimed.
Before describing the present invention, an application scenario of the present invention will be described:
The product line consists of n+1 working procedures, the first n working procedures are used for disassembling and overhauling n parts of the product, and the disassembling sequence of each part has no sequential requirement. The disassembly time of each component is subjected to normal distribution N (a i,bi), the overhaul time of each component is subjected to normal distribution N (c i,di), and the final assembly process time is subjected to normal distribution N (E, F). For a normal distribution N (u, sigma), its probability density function
FIG. 2 is a schematic diagram of a method for optimizing the process sequence of a product line, the method comprising:
Step 1, initializing a process sequence array of a product line, and storing part numbers in the process sequence array, wherein the product line comprises n+1 processes, the first n processes are for disassembling and overhauling n parts, and the disassembling time and the overhauling time of each part are respectively subjected to normal distribution.
As an embodiment, the step 1, initializing a process sequence array of a product line includes: initializing a sequence order array id according to the order of the part numbers from small to large, enabling the element id i of the array to be equal to or larger than 1 and equal to or smaller than n, and initializing an optimized number k to be equal to 1 and j to be equal to 1.
And 2, extracting two part numbers G and H adjacent to each other in the sequence array.
It can be understood that two adjacent part numbers are extracted from the sequence order array in the order in the array, such that the extracted part number g=id j and the part number h=id j+1.
Step 3, calculating the efficiency p1 of processing the component G before processing the component H and the efficiency p2 of processing the component G before processing the component G based on the normal distribution obeyed by the disassembly time and the maintenance time of the components G and H.
As an example, the manner of calculating the efficiency p1 and the efficiency p2 is: the process evaluation time T is calculated and,Wherein Tg is the normal distribution/>, which is time-consuming and obeys for disassembling and overhauling the component GP 0 minutes, th is the normal distribution/>, which is time-consuming and amenable to disassembly and overhaul of component HP 0 minutes. Based on the process evaluation time T, the normal distribution to which the respective component disassembly time is compliant and the normal distribution to which the respective component inspection time is compliant are calculated, the efficiency p1 of the first-processing component G and then the component H is calculated, and the efficiency p2 of the first-processing component H and then the component G is calculated.
Tg and Th are calculated by the following formula:
where p 0 is a known number, p 0 =0.75, and Tg and Th are obtained by solving the above formula.
Then calculate the efficiency p1 of the first processing element G and then the processing element H, comprising:
calculating the efficiency p2 of the first processing unit H and then the processing unit G, comprising:
and 4, if p1 is less than p2, exchanging the positions of the component number G and the component number H in the process sequence array.
It will be appreciated that if p1 < p2, the exchange of the positions of part number G and part number H in the sequence array includes: if p 1<p2, let id j＝H,idj+1 =g; if p 1＞p2, then the positions of G and H in the sequence array are unchanged.
It will be appreciated that if P 1<p2 illustrates that the efficiency P1 of processing component G before component H is lower than the efficiency P2 of processing component H before component G, then adjustments to the existing processing sequence are required to interchange the positions of component G and component H in the sequence array.
And 5, executing the steps 2 to 4 on the part numbers in the sequence order array based on the bubbling sequencing method to obtain the sequenced sequence order array, namely the optimized product line sequence.
Wherein, the step 5 comprises the following steps: step 51, updating j=j+1, if j is less than or equal to n-k, executing step 2, otherwise executing step 52; step 52, update k=k+1, if k is less than or equal to n-1, execute step 2 after resetting j=1, otherwise terminate the calculation.
It can be understood that the ranking is performed according to the processing efficiency based on the bubbling ranking method, so that the ranking with the highest final processing efficiency is obtained, namely the product line process sequence optimization scheme.
The method provided by the invention is described below with a specific example,
As shown in fig. 1, a certain product line has 11 steps, and the first 10 steps involve disassembly and maintenance of components. The component disassembly time was subjected to a normal distribution N (a i,bi), and the component overhaul time was subjected to a normal distribution N (c i,di), see table 1. The final assembly process is time consuming following the normal distribution N (15,3.5). The time units consumed are hours. The process sequence of the product line is optimized using the method of the present invention.
TABLE 1
| Part number i | a | b | c | d |
| 1 | 16.5 | 2.1 | 29.4 | 4.4 |
| 2 | 36.5 | 9.4 | 23.4 | 5.8 |
| 3 | 46.3 | 6.9 | 52.7 | 12.2 |
| 4 | 52.4 | 14.3 | 55.8 | 11.3 |
| 5 | 27.4 | 2.7 | 45.8 | 12.1 |
| 6 | 14.7 | 2.7 | 31.3 | 3.5 |
| 7 | 57.2 | 16.5 | 49 | 6.4 |
| 8 | 20.4 | 3.5 | 50.2 | 6.1 |
| 9 | 29.7 | 8.1 | 16.3 | 4.1 |
| 10 | 45.2 | 7.9 | 10.3 | 2.6 |
Solution: 1) Procedure order array ids, id= [12 34 5 6 78 9 10], are initialized in order of part numbers from small to large. The optimization number k=1 is initialized, and the optimization range number j=1.
2) Let part number g=id j, part number h=id j+1.
3) The process evaluation time T is calculated and,Wherein Tg is normal distribution/>Th is normal distribution/>0.75 Minutes of (a), i.e., satisfies:
4) The efficiency p 1,p1 = 0.0532 of the first component G and then component H is calculated.
5) The efficiency p 2,p2 = 0.0112 of the first component H and then component G is calculated.
6) The order of parts G and H is optimized. Let id j＝H,idj+1 =g if p 1<p2, otherwise execute directly 7).
7) Update j=j+1, execute 2) if j+.n-k, execute 8) otherwise).
8) Update k=k+1, if k+.n-1, execute 2 after reset j=1), otherwise execute 9). After executing 2) to 8) a plurality of times, the optimization is terminated, and the process sequence array id= [ 48 7 361 52 9 10].
In the above example, 10 parts have 360 tens of thousands of possible orders, the optimized id is the most time-efficient optimal order, and the reverse order of ids (10, 9, 2, 5, 1,6, 3, 7, 8, 4) is the worst time-consuming order. A simulation model of the product line can be established to verify the two product lines of id and the reverse order of id of the above calculation example, the simulation results in probability of completing one product within a certain time t, and the simulation result is shown in figure 3. Fig. 3 shows that within 400 hours, the probability of the best order product line completing work is 0.85, and the probability of the worst order product line completing work is only 0.30. The method provided by the invention has a relatively remarkable optimizing effect.
The method for optimizing the working procedure sequence of the product line provided by the embodiment of the invention adopts the bubbling sequencing method to reorder the component numbers in the working procedure sequence array, the sequencing basis is to process the efficiency of the components according to different sequences, and the processing sequences of the different components are adjusted according to the sequence with high efficiency, so that the working procedure of the product line is optimized, and the aim of automatically optimizing the working procedure of the product line is fulfilled.
In the foregoing embodiments, the descriptions of the embodiments are focused on, and for those portions of one embodiment that are not described in detail, reference may be made to the related descriptions of other embodiments.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.
Claims (5)
1. A method for optimizing a product line process sequence, comprising:
Step 1, initializing a process sequence array of a product line, wherein part numbers are stored in the process sequence array, the product line comprises n+1 processes, the first n processes are for disassembling and overhauling n parts, and the disassembling time and the overhauling time of each part are respectively subjected to normal distribution;
step 2, extracting a part G and a part H corresponding to two part numbers adjacent to each other in front and back in the process sequence array;
step 3, calculating the efficiency p1 of processing the component G before processing the component H and the efficiency p2 of processing the component H before processing the component G based on the normal distribution obeying the disassembling time and the maintenance time of the component G and the component H;
Step 4, if p1 is less than p2, exchanging the positions of the number corresponding to the component G and the number corresponding to the component H in the process sequence array;
Step 5, executing the step 2 to the step 4 on the part numbers in the sequence order array based on the bubbling sequencing method to obtain a sequenced sequence order array, namely the optimized product line procedure;
and step 2, extracting a part G and a part H corresponding to two part numbers adjacent to each other in front and back in the process sequence array, including:
Let part g=id j, part h=id j+1;
Step 3, based on the normal distribution obeyed by the disassembling time and the maintenance time of the components G and H, calculates the efficiency p1 of processing the component G before processing the component H, and calculates the efficiency p2 of processing the component H before processing the component G, comprising:
The process evaluation time T is calculated and, Tg is normal distribution of time consuming and compliant disassembly and maintenance of component GP 0 minutes, th is a normal distribution which is time-consuming and compliant for disassembling and overhauling of the component HP 0 minutes;
Based on the process evaluation time T, calculating the efficiency p1 of processing the component G before processing the component H and the efficiency p2 of processing the component H before processing the component G;
The calculation of the efficiency p1 of the processing-before-processing component G and the processing component H comprises:
the calculation of the efficiency p2 of the processing-before-processing component H and then of the processing component G comprises:
2. the process sequence optimization method of a product line according to claim 1, wherein the initializing the process sequence array of the product line in step 1 comprises:
Initializing a sequence order array id according to the order of the part numbers from small to large, enabling the element id i of the array to be equal to or larger than 1 and equal to or smaller than n, and initializing an optimized number k to be equal to 1 and j to be equal to 1.
3. The product line process sequence optimization method of claim 1, wherein Tg and Th are calculated by the following formula:
Where p 0 = 0.75, solved for Tg and Th.
4. The method according to claim 1, wherein the step 4, if p1 < p2, exchanges the positions of the part number G and the part number H in the process sequence array, includes:
If p1< p2, let id j＝H,idj+1 =g;
if p 1> p2, then G and H are unchanged in position in the sequence array.
5. The method according to claim 4, wherein the step 5, performing steps 2 to 4 on the part numbers in the sequence array based on the bubbling sequencing method, obtains a sequenced sequence array, that is, the optimized product line process, includes:
step 51, updating j=j+1, if j is less than or equal to n-k, executing step 2, otherwise executing step 52;
Step 52, update k=k+1, if k is less than or equal to n-1, execute step 2 after resetting j=1, otherwise terminate the calculation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311197289.6A CN117314142B (en) | 2023-09-15 | 2023-09-15 | Product line process sequence optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311197289.6A CN117314142B (en) | 2023-09-15 | 2023-09-15 | Product line process sequence optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117314142A CN117314142A (en) | 2023-12-29 |
| CN117314142B true CN117314142B (en) | 2024-05-28 |
Family
ID=89241781
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311197289.6A Active CN117314142B (en) | 2023-09-15 | 2023-09-15 | Product line process sequence optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117314142B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117808458B (en) * | 2024-03-01 | 2024-06-11 | 中国人民解放军海军工程大学 | Equipment repair line optimization method, system, electronic equipment and storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009245043A (en) * | 2008-03-31 | 2009-10-22 | Hitachi Ltd | Method and device for supporting line production management |
| CN102608916A (en) * | 2012-02-15 | 2012-07-25 | 浙江工业大学 | Cell-machine based dynamic scheduling method for large part flexible job shop |
| CN104992236A (en) * | 2015-06-15 | 2015-10-21 | 南京埃斯顿自动化股份有限公司 | Automatic layout method of bending machine processes |
| CN107807623A (en) * | 2017-11-24 | 2018-03-16 | 大连理工大学 | Flexible machine adds the Dynamic Scheduling method, system and the application in high ferro motor-car parts group flexible machine adds production line of production line |
| CN111319052A (en) * | 2020-02-28 | 2020-06-23 | 五邑大学 | Multi-stain cleaning robot and moving path control method based on same |
| CN113327058A (en) * | 2021-06-24 | 2021-08-31 | 哈尔滨理工大学 | Comprehensive scheduling method for ordering same equipment process in root tree longitudinal and transverse pre-scheduling manner |
| CN113919204A (en) * | 2021-10-29 | 2022-01-11 | 长春工业大学 | Comprehensive importance analysis method for availability of multi-state manufacturing system |
| CN115545246A (en) * | 2021-06-28 | 2022-12-30 | 上海交通大学 | Multi-vehicle batch flexible production line scheduling method |
| CN115759479A (en) * | 2022-12-12 | 2023-03-07 | 中国人民解放军海军工程大学 | Complex equipment fault positioning optimization method and system based on comprehensive values |
| CN115879720A (en) * | 2022-12-12 | 2023-03-31 | 中国人民解放军海军工程大学 | Inspection sequence optimization method and system adopting universal inspection tool for inspection |
| CN116579572A (en) * | 2023-05-23 | 2023-08-11 | 中国人民解放军海军工程大学 | Maintenance time-consuming mechanical part spare part analysis method and device obeying normal distribution |
-
2023
- 2023-09-15 CN CN202311197289.6A patent/CN117314142B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009245043A (en) * | 2008-03-31 | 2009-10-22 | Hitachi Ltd | Method and device for supporting line production management |
| CN102608916A (en) * | 2012-02-15 | 2012-07-25 | 浙江工业大学 | Cell-machine based dynamic scheduling method for large part flexible job shop |
| CN104992236A (en) * | 2015-06-15 | 2015-10-21 | 南京埃斯顿自动化股份有限公司 | Automatic layout method of bending machine processes |
| CN107807623A (en) * | 2017-11-24 | 2018-03-16 | 大连理工大学 | Flexible machine adds the Dynamic Scheduling method, system and the application in high ferro motor-car parts group flexible machine adds production line of production line |
| CN111319052A (en) * | 2020-02-28 | 2020-06-23 | 五邑大学 | Multi-stain cleaning robot and moving path control method based on same |
| CN113327058A (en) * | 2021-06-24 | 2021-08-31 | 哈尔滨理工大学 | Comprehensive scheduling method for ordering same equipment process in root tree longitudinal and transverse pre-scheduling manner |
| CN115545246A (en) * | 2021-06-28 | 2022-12-30 | 上海交通大学 | Multi-vehicle batch flexible production line scheduling method |
| CN113919204A (en) * | 2021-10-29 | 2022-01-11 | 长春工业大学 | Comprehensive importance analysis method for availability of multi-state manufacturing system |
| CN115759479A (en) * | 2022-12-12 | 2023-03-07 | 中国人民解放军海军工程大学 | Complex equipment fault positioning optimization method and system based on comprehensive values |
| CN115879720A (en) * | 2022-12-12 | 2023-03-31 | 中国人民解放军海军工程大学 | Inspection sequence optimization method and system adopting universal inspection tool for inspection |
| CN116579572A (en) * | 2023-05-23 | 2023-08-11 | 中国人民解放军海军工程大学 | Maintenance time-consuming mechanical part spare part analysis method and device obeying normal distribution |
Non-Patent Citations (8)
| Title |
|---|
| 一种解决柔性制造单元中设备使用不平衡的方法;许朝山;;新技术新工艺;20141125(第11期);全文 * |
| 两台机器流水作业在序列错位下最小化最大完工时间重新排序;慕运动;王丹丹;;周口师范学院学报;20190315(第02期);全文 * |
| 基于Flexsim模拟的装配车间流程优化方案;贾从;曹二伟;;物流工程与管理;20180715(第07期);全文 * |
| 基于动态双种群粒子群算法的柔性工作车间调度;李丹;高立群;马佳;李扬;;东北大学学报(自然科学版);20070915(第09期);全文 * |
| 存在多设备工序的综合调度算法;谢志强;齐永红;杨静;;机械工程学报;20141231(第24期);全文 * |
| 机组检修优化的最小缺电量模型;廖胜利;程春田;李刚;谢一工;蔡华祥;;电网技术;20101005(第10期);全文 * |
| 猫群优化算法求解柔性作业车间调度问题;姜天华;;计算机工程与应用;20180327(第23期);全文 * |
| 自动引导车最优动态调度问题建模与仿真;陆天;王嘉珩;夏裕东;李厚彪;;计算机应用;20200710(第S1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117314142A (en) | 2023-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN117314142B (en) | Product line process sequence optimization method | |
| CN104268722B (en) | Dynamic flexible job-shop scheduling method based on multi-objective Evolutionary Algorithm | |
| CN116512250B (en) | Disassembling line balancing method based on man-machine cooperation | |
| CN117314143A (en) | Product repair line transformation method | |
| CN112560284A (en) | Power distribution network planning method for multi-subject game and terminal equipment | |
| CN111311090A (en) | Intelligent scheduling method and device based on big data calculation and analysis | |
| CN114219217A (en) | Parallel disassembly line setting method for non-merged priority relation matrix | |
| CN106257508A (en) | Maintenance task dispatching method and system | |
| CN115115113A (en) | Equipment fault prediction method and system based on graph attention network relation embedding | |
| CN113723803A (en) | Parallel machine system processing optimization method combining maintenance strategy and task scheduling | |
| CN107085416B (en) | Feedback control method and system for station bad information | |
| CN115204619A (en) | Flexible workshop scheduling method, device and system based on improved genetic algorithm decoding | |
| CN115879719A (en) | Traversal partition-based parallel fault positioning optimization method and system | |
| CN115438929A (en) | Scheduling method for reentrant process of aeroengine assembly workshop | |
| CN110059830A (en) | A kind of skilled work post industry pattern training technique based on artificial intelligence technology | |
| CN108876289A (en) | A kind of contract approval system and method | |
| CN113822379B (en) | Process process anomaly analysis method and device, electronic equipment and storage medium | |
| CN115759479A (en) | Complex equipment fault positioning optimization method and system based on comprehensive values | |
| CN108363789A (en) | A kind of industry and commerce user power utilization table code data lack method for repairing and mending and device in short term | |
| CN111932021B (en) | Remanufacturing system scheduling method | |
| CN110866150B (en) | Method for rapidly generating ledger data map and overhauling defects of pre-control equipment family | |
| CN109543276B (en) | Method for determining spare part demand of multi-Gamma unit of long-term guarantee task of large cargo ship | |
| CN114462735A (en) | Intelligent pushing method for quality defect report of nuclear power plant | |
| CN113568385A (en) | Production scheduling method based on multi-variety mixed flow assembly mode | |
| CN112380042A (en) | Fault positioning and analyzing method and device for database software and storage medium |
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 |