CN117094509A - Scheduling method, equipment and storage medium for correcting production flow - Google Patents
Scheduling method, equipment and storage medium for correcting production flow Download PDFInfo
- Publication number
- CN117094509A CN117094509A CN202311067196.1A CN202311067196A CN117094509A CN 117094509 A CN117094509 A CN 117094509A CN 202311067196 A CN202311067196 A CN 202311067196A CN 117094509 A CN117094509 A CN 117094509A
- Authority
- CN
- China
- Prior art keywords
- time
- processing
- scheduling
- locking
- equipment
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 175
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 51
- 238000003860 storage Methods 0.000 title claims abstract description 10
- 230000008569 process Effects 0.000 claims abstract description 99
- 238000012545 processing Methods 0.000 claims abstract description 96
- 230000035772 mutation Effects 0.000 claims abstract description 11
- 238000012163 sequencing technique Methods 0.000 claims abstract description 4
- 238000004364 calculation method Methods 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization 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/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
- G06Q10/06316—Sequencing of tasks or work
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Factory Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a scheduling method, equipment and storage medium for correcting a production flow, which comprises the following steps: acquiring current scheduling processing equipment and processing procedures thereof, scheduling calendars, production procedures of orders to be produced and procedure processing time, and setting the current scheduling processing equipment and processing procedures thereof or designated processing time or designated processing procedures of equipment into a locking state; dividing processing equipment according to processing procedures in a locking state according to a production scheduling calendar, generating an array of time range intervals capable of being produced, and carrying out crossover and mutation operations by randomly generating procedure combinations based on the processing equipment and the production procedures of orders; determining a locking state set by each process in the process combination subjected to the crossing and mutation operation, calculating corresponding starting time and ending time according to the dependence relationship between the interval of the productive time range and the production process, and sequencing different process combinations according to the fitness; and selecting the working procedure combination output scheduling scheme with the optimal fitness.
Description
Technical Field
The present invention relates to the field of scheduling technologies, and in particular, to a scheduling method, apparatus, and storage medium for correcting a production process.
Background
Along with the change of market environment and the increase of market competition, the production mode is increasingly various, the customer is customized and flexible, the customer is strictly engaged in the delivery period, and a manufacturing enterprise generally needs to make a plurality of complex scheduling plans to coordinate production resources so as to meet the production target, especially in the enterprise production process: people, machines, materials, methods, loops, etc. all involve planning, execution, analysis, optimization, and decision-making, and in related scenarios, to meet production goals, a scheduling plan is usually manually formulated by manually knowing each production detail of an enterprise in detail and relying on production experience. However, in the above process, the manual scheduling needs to be discussed and modified several times, which takes a long time, and thus results in low efficiency of scheduling.
Accordingly, the present invention provides a method, apparatus and storage medium for scheduling correction of a production process.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a scheduling method, equipment and a storage medium for correcting a production flow, which are used for improving the efficiency of scheduling.
The technical scheme of the invention is realized as follows:
a scheduling method for correcting a production flow comprises the following steps:
step S01: acquiring current scheduling processing equipment and processing procedures thereof, scheduling calendars, production procedures of orders to be produced and procedure processing time, and setting the current scheduling processing equipment and processing procedures thereof or designated processing time or designated processing procedures of equipment into a locking state;
step S02: dividing processing equipment according to processing procedures in a locking state according to a production scheduling calendar, generating an array of time range intervals capable of being produced, and carrying out crossover and mutation operations by randomly generating procedure combinations based on the processing equipment and the production procedures of orders;
step S03: determining a locking state set by each process in the process combination subjected to the crossing and mutation operation, calculating corresponding starting time and ending time according to the dependence relationship between the productive time range interval and the production process, and sequencing different process combinations according to the fitness;
step SO4: and selecting the working procedure combination output scheduling scheme with the optimal fitness.
Preferably, the locking state includes one of a full locking, a locking start time and a locking end time according to the locking time and the equipment condition, wherein the full locking is that the processing equipment of the process and the start time and the end time thereof are fixed, the locking start time is that the start time of the process is not earlier than the specified time, and the locking end time is that the end time of the process is not later than the specified time.
Preferably, the method for calculating the start time and the end time of each process in the process combination subjected to the crossover and mutation operation is as follows:
if the locking state of the process is full locking, the starting time and the ending time of the process are both designated time;
if the locking state of the process is the locking start time, judging whether the process has a pre-process or not, if no pre-task exists, the start time of the process is the earliest time which can be produced by processing equipment and the later time in the appointed time, the end time is the sum of the start time and the process processing time, and if the pre-task exists, the process start time is the latest end time of the pre-process and the later time in the appointed time, and the end time is the sum of the start time and the process processing time;
if the locking state of the process is the locking ending time, judging whether the process has a preposed process, if the preposed process is not carried out and the earliest time of the processing equipment capable of producing is later than the difference between the appointed time and the processing time, the starting time of the process is infinite and marked as an infeasible scheme, if the preposed process is not carried out and the earliest time of the processing equipment capable of producing is earlier than the difference between the appointed time and the processing time, the starting time of the process is the earliest time capable of producing, and the ending time is the sum of the starting time and the processing time; if a pre-process exists and the latest end time of the pre-process is later than the difference between the designated time and the processing time, the start time of the pre-process is infinite and marked as an infeasible scheme, and if the pre-process exists and the end time of the pre-process is earlier than the difference between the designated time and the processing time, the start time of the pre-process is the latest end time of the pre-process and the end time is the sum of the start time and the processing time.
Preferably, the fitness is calculated according to influencing factors, wherein the influencing factors comprise order delay rate, equipment utilization rate and processing cost.
The invention provides an electronic device, which comprises a memory and a processor, wherein the memory stores computer execution instructions; the processor executing computer-executable instructions stored in the memory causes the processor to perform the method of scheduling a revised manufacturing flow as claimed in any one of claims 1 to 4.
The invention also proposes a computer-readable storage medium having stored therein computer-executable instructions for implementing a scheduling method for a modified production flow as claimed in any one of claims 1 to 4 when the computer-executable instructions are executed by a processor.
Compared with the prior art, the invention has the following advantages:
when an order to be produced is newly added, the processing equipment of the current shift and the processing procedure thereof or the designated processing time or the processing procedure of the designated equipment are set to be in a locked state, the processing procedure of the processing equipment is divided according to the locked state, a procedure combination in a range of the dischargeable time is generated, then the corresponding starting time and ending time are calculated according to the dependence relationship between the range of the dischargeable time and the production procedure, and the procedure with the optimal fitness is output as a scheduling scheme, so that the efficiency of the designated scheduling is improved while the production is corrected.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a flow chart of a method for scheduling correction of a production flow according to the present invention;
fig. 2 is a block flow diagram of the calculation of the start time and the end time of fig. 1.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. 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 the description of the present invention, it should be noted that the azimuth or positional relationship indicated by the terms "center", "up", "down", "left", "right", "vertical", "horizontal", "inside", "outside", etc. are based on the azimuth or positional relationship shown in the drawings, are merely for convenience of describing the present invention and simplifying the description, and do not indicate or imply that the apparatus or elements referred to must have a specific azimuth, be constructed and operated in a specific azimuth, and thus should not be construed as limiting the present invention. Furthermore, the terms "first," "second," "third," "fourth," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
In the description of the present invention, it should be noted that, unless explicitly specified and limited otherwise, the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
The embodiment proposes a scheduling method for correcting a production flow, as shown in fig. 1, comprising the following steps: step S01: acquiring processing equipment of a current shift and processing procedures, a production scheduling calendar and production procedures and procedure processing time of an order to be produced, namely, at least one processing equipment of the current shift is provided, the processing procedures are arranged according to the production scheduling calendar, the production procedures of the order to be applied are in a sequence, the processing time of each step is possibly different, and the processing equipment of the current shift and the processing procedures thereof or the designated processing time or the processing procedures of the designated equipment are set to be in a locking state;
step S02: dividing processing equipment according to processing procedures in a locking state according to a production scheduling calendar, generating an array of time range intervals capable of being produced, and carrying out crossover and mutation operations by randomly generating procedure combinations based on the processing equipment and the production procedures of orders;
step S03: determining a locking state set by each process in the process combination subjected to the crossing and mutation operation, calculating corresponding starting time and ending time according to the dependence relationship between the productive time range interval and the production process, namely, after finishing the front process in the productive time range interval, finishing the rear process, and sequencing different process combinations according to the fitness;
step SO4: and selecting the working procedure combination output scheduling scheme with the optimal fitness.
That is, when an order to be newly added is made, the processing equipment of the current shift and the processing procedure thereof or the designated processing time or the processing procedure of the designated equipment are set to be in a locked state, and then the processing procedure of the processing equipment is divided according to the locked state, so that a procedure combination in a time range section capable of being produced is generated, and then the corresponding start time and end time are calculated according to the dependency relationship between the time range section capable of being produced and the production procedure, and the procedure with the optimal fitness is output as a production scheduling scheme, so that the improvement of the production scheduling efficiency is realized while the production is corrected.
In this embodiment, the locking state includes one of a full locking, a locking start time, and a locking end time according to the locking time and the equipment condition, where the full locking is that the processing equipment of the process and its start time and end time are both fixed, the locking start time is that the start time of the process is not earlier than the specified time, and the locking end time is that the end time of the process is not later than the specified time.
In this embodiment, as shown in fig. 2, the calculation method of the start time and the end time of each process in the process combination subjected to the crossover and mutation operation is as follows:
if the locking state of the process is full locking, the starting time and the ending time of the process are both designated time;
if the locking state of the process is the locking start time, judging whether the process has a pre-process or not, if no pre-task exists, the start time of the process is the earliest time which can be produced by processing equipment and the later time in the appointed time, the end time is the sum of the start time and the process processing time, and if the pre-task exists, the start time of the process is the latest end time of the pre-process and the later time in the appointed time, and the end time is the sum of the start time and the process processing time;
if the locking state of the process is the locking ending time, judging whether the process has a preposed process, if the preposed process is not carried out and the earliest time of the processing equipment capable of producing is later than the difference between the appointed time and the processing time, the starting time of the process is infinite and marked as an infeasible scheme, if the preposed process is not carried out and the earliest time of the processing equipment capable of producing is earlier than the difference between the appointed time and the processing time, the starting time of the process is the earliest time capable of producing, and the ending time is the sum of the starting time and the processing time; if a pre-process exists and the latest end time of the pre-process is later than the difference between the designated time and the processing time, the start time of the pre-process is infinite and marked as an infeasible scheme, and if the pre-process exists and the end time of the pre-process is earlier than the difference between the designated time and the processing time, the start time of the pre-process is the latest end time of the pre-process and the end time is the sum of the start time and the processing time.
In this embodiment, the fitness is calculated according to the influencing factors such as the order delay rate (the ratio of the number of order delays to the total number of orders in the designated period), the equipment utilization rate (the ratio of the equipment processing production time to the total working time), the processing cost (the sum of the costs of all the equipment, the equipment production cost=the processing time×the unit cost), and the like.
The embodiment provides an electronic device, which comprises a memory and a processor, wherein the memory stores computer execution instructions; a processor executing computer-executable instructions stored in a memory causes the processor to perform the method of scheduling a modified production flow as claimed in any one of claims 1 to 4.
The present embodiment also proposes a computer-readable storage medium having stored therein computer-executable instructions for implementing a scheduling method for a modified production flow according to any one of claims 1 to 4 when the computer-executable instructions are executed by a processor.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (6)
1. A scheduling method for correcting a production flow is characterized by comprising the following steps: the method comprises the following steps:
step S01: acquiring current scheduling processing equipment and processing procedures thereof, scheduling calendars, production procedures of orders to be produced and procedure processing time, and setting the current scheduling processing equipment and processing procedures thereof or designated processing time or designated processing procedures of equipment into a locking state;
step S02: dividing processing equipment according to processing procedures in a locking state according to a production scheduling calendar, generating an array of time range intervals capable of being produced, and carrying out crossover and mutation operations by randomly generating procedure combinations based on the processing equipment and the production procedures of orders;
step S03: determining a locking state set by each process in the process combination subjected to the crossing and mutation operation, calculating corresponding starting time and ending time according to the dependence relationship between the productive time range interval and the production process, and sequencing different process combinations according to the fitness;
step SO4: and selecting the working procedure combination output scheduling scheme with the optimal fitness.
2. The method of claim 1, wherein: the locking state comprises one of full locking, locking starting time and locking ending time according to the locking time and equipment conditions, wherein the full locking is that the processing equipment of the working procedure is fixed as well as the starting time and the ending time thereof, the locking starting time is that the starting time of the working procedure is not earlier than the appointed time, and the locking ending time is that the ending time of the working procedure is not later than the appointed time.
3. The method of claim 2, wherein: the method for calculating the start time and the end time of each process in the process combination subjected to the crossover and mutation operation comprises the following steps:
if the locking state of the process is full locking, the starting time and the ending time of the process are both designated time;
if the locking state of the process is the locking start time, judging whether the process has a pre-process or not, if no pre-task exists, the start time of the process is the earliest time which can be produced by processing equipment and the later time in the appointed time, the end time is the sum of the start time and the process processing time, and if the pre-task exists, the process start time is the latest end time of the pre-process and the later time in the appointed time, and the end time is the sum of the start time and the process processing time;
if the locking state of the process is the locking ending time, judging whether the process has a preposed process, if the preposed process is not carried out and the earliest time of the processing equipment capable of producing is later than the difference between the appointed time and the processing time, the starting time of the process is infinite and marked as an infeasible scheme, if the preposed process is not carried out and the earliest time of the processing equipment capable of producing is earlier than the difference between the appointed time and the processing time, the starting time of the process is the earliest time capable of producing, and the ending time is the sum of the starting time and the processing time; if a pre-process exists and the latest end time of the pre-process is later than the difference between the designated time and the processing time, the start time of the pre-process is infinite and marked as an infeasible scheme, and if the pre-process exists and the end time of the pre-process is earlier than the difference between the designated time and the processing time, the start time of the pre-process is the latest end time of the pre-process and the end time is the sum of the start time and the processing time.
4. The method of claim 1, wherein: the adaptability is calculated according to influence factors, wherein the influence factors comprise order delay rate, equipment utilization rate and processing cost.
5. An electronic device, characterized in that: the system comprises a memory and a processor, wherein the memory stores computer-executable instructions; the processor executing computer-executable instructions stored in the memory causes the processor to perform the method of scheduling a revised manufacturing flow as claimed in any one of claims 1 to 4.
6. A computer-readable storage medium, characterized by: the computer-readable storage medium having stored therein computer-executable instructions for implementing the method of scheduling a modified manufacturing flow as claimed in any one of claims 1 to 4 when the computer-executable instructions are executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311067196.1A CN117094509A (en) | 2023-08-23 | 2023-08-23 | Scheduling method, equipment and storage medium for correcting production flow |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311067196.1A CN117094509A (en) | 2023-08-23 | 2023-08-23 | Scheduling method, equipment and storage medium for correcting production flow |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117094509A true CN117094509A (en) | 2023-11-21 |
Family
ID=88776597
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311067196.1A Pending CN117094509A (en) | 2023-08-23 | 2023-08-23 | Scheduling method, equipment and storage medium for correcting production flow |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117094509A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117745721A (en) * | 2024-02-19 | 2024-03-22 | 江苏中天互联科技有限公司 | Scheduling plan optimization method based on identification analysis and related equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105629927A (en) * | 2015-12-18 | 2016-06-01 | 武汉开目信息技术有限责任公司 | Hybrid genetic algorithm-based MES (Manufacturing Execution System) production planning and scheduling method |
| CN109359884A (en) * | 2018-10-31 | 2019-02-19 | 南京航空航天大学 | Aviation complex equipment structural member Production Scheduling Problem and rescheduling method |
| CN112070378A (en) * | 2020-08-28 | 2020-12-11 | 常州市龙星工业自动化系统有限公司 | Production scheduling management method based on logic priority principle by utilizing computer |
| CN112508309A (en) * | 2021-01-29 | 2021-03-16 | 深圳坤湛科技有限公司 | Intelligent scheduling method, equipment and computer storage medium |
| CN113433915A (en) * | 2021-07-08 | 2021-09-24 | 南京航空航天大学苏州研究院 | Automatic scheduling algorithm for workshop sheet metal machining |
| CN115700639A (en) * | 2022-12-30 | 2023-02-07 | 东方合智数据科技(广东)有限责任公司 | Intelligent production scheduling method, device, equipment and storage medium |
-
2023
- 2023-08-23 CN CN202311067196.1A patent/CN117094509A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105629927A (en) * | 2015-12-18 | 2016-06-01 | 武汉开目信息技术有限责任公司 | Hybrid genetic algorithm-based MES (Manufacturing Execution System) production planning and scheduling method |
| CN109359884A (en) * | 2018-10-31 | 2019-02-19 | 南京航空航天大学 | Aviation complex equipment structural member Production Scheduling Problem and rescheduling method |
| CN112070378A (en) * | 2020-08-28 | 2020-12-11 | 常州市龙星工业自动化系统有限公司 | Production scheduling management method based on logic priority principle by utilizing computer |
| CN112508309A (en) * | 2021-01-29 | 2021-03-16 | 深圳坤湛科技有限公司 | Intelligent scheduling method, equipment and computer storage medium |
| CN113433915A (en) * | 2021-07-08 | 2021-09-24 | 南京航空航天大学苏州研究院 | Automatic scheduling algorithm for workshop sheet metal machining |
| CN115700639A (en) * | 2022-12-30 | 2023-02-07 | 东方合智数据科技(广东)有限责任公司 | Intelligent production scheduling method, device, equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117745721A (en) * | 2024-02-19 | 2024-03-22 | 江苏中天互联科技有限公司 | Scheduling plan optimization method based on identification analysis and related equipment |
| CN117745721B (en) * | 2024-02-19 | 2024-05-07 | 江苏中天互联科技有限公司 | Scheduling plan optimization method based on identification analysis and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107590603B (en) | Based on the dispatching method and system for improving change neighborhood search and differential evolution algorithm | |
| CN117094509A (en) | Scheduling method, equipment and storage medium for correcting production flow | |
| US6278978B1 (en) | Agent scheduling system and method having improved post-processing step | |
| US20180356803A1 (en) | Method and system for batch scheduling uniform parallel machines with different capacities based on improved genetic algorithm | |
| US20110296371A1 (en) | Creating A Test Progression Plan | |
| CN107766245A (en) | The online sort method of variable dynamics combined test use-case priority based on OTT strategies | |
| CN108460463A (en) | High-end equipment flow line production dispatching method based on improved adaptive GA-IAGA | |
| CN111222553B (en) | Training data processing method and device of machine learning model and computer equipment | |
| CN110516475A (en) | A kind of data processing method, device and server | |
| CN112383368B (en) | Beam measurement method and system | |
| Zaman et al. | Scenario-based solution approach for uncertain resource constrained scheduling problems | |
| CN108664593A (en) | Data consistency verification method, device, storage medium and electronic equipment | |
| CN116187738B (en) | Automatic generation method of work package based on execution sequence and position distribution | |
| CN115619200B (en) | Scheduling and multi-functional scheduling combination optimization method and device for split-type serum | |
| CN112884370B (en) | Multi-project rescheduling method and system for high-end equipment development process considering order insertion list | |
| CN114594745A (en) | Bottleneck station analysis method, analysis equipment and computer storage medium | |
| CN109961338A (en) | A kind of transaction methods, system | |
| CN110395413B (en) | Automatic scheduling method for rapid orbit determination multi-testing station | |
| CN113962059A (en) | Unrelated parallel machine scheduling method and related equipment thereof | |
| CN112836991A (en) | Site planning method and device, terminal equipment and readable storage medium | |
| CN113055239A (en) | Data display method, device, equipment and medium | |
| CN105142165B (en) | Search the method and device of terminal device | |
| EP3460732A1 (en) | Dispatching method and system based on multiple levels of steady state production rate in working benches | |
| US20180196412A1 (en) | Unknow | |
| CN113206882B (en) | Consensus method, computer device 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 |