CN116485130A - Method and device for generating procedure scheduling plan, electronic equipment and storage medium - Google Patents
Method and device for generating procedure scheduling plan, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN116485130A CN116485130A CN202310423415.9A CN202310423415A CN116485130A CN 116485130 A CN116485130 A CN 116485130A CN 202310423415 A CN202310423415 A CN 202310423415A CN 116485130 A CN116485130 A CN 116485130A
- Authority
- CN
- China
- Prior art keywords
- processing
- order
- processing equipment
- time
- procedure
- 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 367
- 238000003860 storage Methods 0.000 title claims abstract description 20
- 230000008569 process Effects 0.000 claims abstract description 182
- 238000012545 processing Methods 0.000 claims abstract description 169
- 238000004519 manufacturing process Methods 0.000 claims abstract description 36
- 238000004590 computer program Methods 0.000 claims description 16
- 239000004973 liquid crystal related substance Substances 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 description 9
- 238000003754 machining Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 3
- 238000013473 artificial intelligence Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- 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/06311—Scheduling, planning or task assignment for a person or group
-
- 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/06315—Needs-based resource requirements planning or 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/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
-
- 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/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method, a device, electronic equipment and a storage medium for generating a procedure scheduling plan; the method comprises the following steps: acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1; calculating processing equipment corresponding to each procedure in the data to be processed; determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure; a scheduling plan for each process in each order is generated based on the latest start time of each process on each processing tool. The embodiment of the application can realize parallel production scheduling among different procedures of the same order, thereby saving time and meeting the actual demands of users.
Description
Technical Field
The embodiment of the application relates to the technical field of application of artificial intelligence, in particular to a method, a device, electronic equipment and a storage medium for generating a process scheduling plan.
Background
With the rapid development of machining technology, the functions of mechanical parts are increasingly diversified, and the part structure tends to be complicated. Most parts are produced by a plurality of working procedures, and the problems of multiple orders, multiple working procedures and multiple equipment production are described as follows: simultaneously scheduling a plurality of orders, each order having a specified delivery time; each order has a plurality of working procedures to be processed, and a specific sequence is arranged among the working procedures; the production of orders involves a plurality of devices, each process needs to be processed on a specific device, a plurality of devices are selected for some processes, and some processes can only be processed on one device; there may be orders with multiple processes being processed on the same equipment. When multiple processes are processed on the same equipment, the change-over time is often involved, a certain change-over time is often required for switching between different models, and sometimes the change-over time ratio is high.
The requirement for production scheduling is that all orders can be delivered on time as much as possible, and other requirements may be met, such as the highest possible utilization of the machine, the shortest overall production time, and the greatest possible balance among machines with similar functions.
In carrying out the present application, the applicant has found that at least the following problems exist in the prior art:
under the conditions that the optional processing equipment and the number of the working procedures required to be processed by each processing equipment are uncertain, parallel production cannot be realized among different working procedures of the same order, and the processing of the next working procedure can only be started after the processing of the previous working procedure is finished, so that a lot of time is wasted; in addition, if there are too many working procedures on the same equipment, there are many possible production ways. For example, assuming that the total number of procedures is n, the number of constraints required is 1/2×n× (n-1), and the possible production method is a factorial of n, which is difficult to solve in the case of too many procedures, and takes too long to meet the actual requirements.
Disclosure of Invention
The method, the device, the electronic equipment and the storage medium for generating the procedure scheduling plan can realize parallel scheduling among different procedures of the same order, so that time can be saved, and the actual demands of users can be met.
In a first aspect, an embodiment of the present application provides a method for generating a process scheduling plan, where the method includes:
acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1;
calculating processing equipment corresponding to each procedure in the data to be processed;
determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure;
a scheduling plan for each process in each order is generated based on the latest start time of each process on each processing tool.
In a second aspect, an embodiment of the present application further provides a process scheduling plan generating apparatus, including: the device comprises an acquisition module, a calculation module, a determination module and a generation module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the acquisition module is used for acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1;
the calculation module is used for calculating processing equipment corresponding to each procedure in the data to be processed;
the determining module is used for determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure;
the generation module is used for generating a production scheduling plan of each process in each order according to the latest starting time of each process on each processing device.
In a third aspect, an embodiment of the present application provides an electronic device, including:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the process scheduling plan generation method described in any embodiment of the present application.
In a fourth aspect, embodiments of the present application provide a storage medium having stored thereon a computer program which, when executed by a processor, implements the process scheduling plan generating method described in any embodiment of the present application.
The embodiment of the application provides a method, a device, electronic equipment and a storage medium for generating a procedure scheduling plan, wherein data to be processed are firstly obtained; then calculating processing equipment corresponding to each procedure in the data to be processed; determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure; and finally, generating a production schedule of each process in each order according to the latest starting time of each process on each processing equipment. That is, in the technical solution of the present application, the number of processes that need to be processed on each processing apparatus need not be solved, but the processing apparatus corresponding to each process is solved first, and then the latest start time of each process on the same processing apparatus is determined, so that a production schedule of each process in each order can be generated. In the prior art, under the condition that the number of optional processing equipment and the working procedures required to be processed by each processing equipment is not determined, parallel production cannot be realized among different working procedures of the same order, and the next working procedure can only be started after the last working procedure is processed, so that a lot of time is wasted; in addition, if there are too many working procedures on the same equipment, there are many possible production ways. For example, assuming that the total number of procedures is n, the number of constraints required is 1/2×n× (n-1), and the possible production method is a factorial of n, which is difficult to solve in the case of too many procedures, and takes too long to meet the actual requirements. Therefore, compared with the prior art, the method, the device, the electronic equipment and the storage medium for generating the procedure scheduling plan provided by the embodiment of the application can realize parallel scheduling among different procedures of the same order, so that the time can be saved, and the actual demands of users can be met; in addition, the technical scheme of the embodiment of the application is simple and convenient to realize, convenient to popularize and wider in application range.
Drawings
FIG. 1 is a first flow chart of a process scheduling plan generating method according to an embodiment of the present disclosure;
FIG. 2 is a second flow chart of a process scheduling plan generating method according to an embodiment of the present disclosure;
FIG. 3 is a third flow chart of a process scheduling plan generating method according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of a process scheduling plan generating apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
Fig. 1 is a schematic flow chart of a first process scheduling plan generating method according to an embodiment of the present application, where the method may be performed by a process scheduling plan generating apparatus or an electronic device, and the apparatus or the electronic device may be implemented by software and/or hardware, and the apparatus or the electronic device may be integrated into any intelligent device having a network communication function. As shown in fig. 1, the process scheduling plan generation method may include the steps of:
s101, acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1.
In this step, the electronic device may acquire data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1. Specifically, the electronic device may first acquire the original data; and then preprocessing the original data to obtain the data to be processed. The original data in the embodiment of the application at least comprises: the method comprises the steps of number of orders, delivery time of each order, machining procedure of each order, machining sequence of machining procedure of each order, machining equipment corresponding to each order, minimum machining number of each machining equipment, machining time of minimum machining number and mold changing time.
S102, calculating processing equipment corresponding to each procedure in the data to be processed.
In this step, the electronic device may calculate a processing device corresponding to each process in the data to be processed. Specifically, the electronic device may calculate the latest start time of each procedure in each order based on the delivery deadline of each order; and then determining the processing equipment corresponding to each process according to the latest starting time of each process in each order and the processing time of each process in each order.
S103, determining the latest starting time of each process on each processing device according to the processing device corresponding to each process.
In this step, the electronic device may determine the latest start time of each process on each processing device according to the processing device to which each process corresponds. Specifically, the electronic device may build a mixed integer programming model based on all processes and all processing devices; then solving the mixed integer programming model to obtain the latest starting time of each procedure on corresponding processing equipment; and adjusting the latest starting time of each process on the corresponding processing equipment to obtain the adjusted latest starting time of each process on the corresponding processing equipment.
S104, generating a production schedule of each process in each order according to the latest starting time of each process on each processing device.
In this step, the electronic device may generate a production schedule for each process in each order based on the latest start time of each process on each processing device. Specifically, the electronic device may sort all orders and all processes in each order according to the latest start time of each process, to obtain a scheduling plan for each process in each order.
The method for generating the procedure scheduling plan provided by the embodiment of the application comprises the steps of firstly obtaining data to be processed; then calculating processing equipment corresponding to each procedure in the data to be processed; determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure; and finally, generating a production schedule of each process in each order according to the latest starting time of each process on each processing equipment. That is, in the technical solution of the present application, the number of processes that need to be processed on each processing apparatus need not be solved, but the processing apparatus corresponding to each process is solved first, and then the latest start time of each process on the same processing apparatus is determined, so that a production schedule of each process in each order can be generated. In the prior art, under the condition that the number of optional processing equipment and the working procedures required to be processed by each processing equipment is not determined, parallel production cannot be realized among different working procedures of the same order, and the next working procedure can only be started after the last working procedure is processed, so that a lot of time is wasted; in addition, if there are too many working procedures on the same equipment, there are many possible production ways. For example, assuming that the total number of procedures is n, the number of constraints required is 1/2×n× (n-1), and the possible production method is a factorial of n, which is difficult to solve in the case of too many procedures, and takes too long to meet the actual requirements. Therefore, compared with the prior art, the process scheduling plan generation method provided by the embodiment of the application can realize parallel scheduling among different processes of the same order, so that the time can be saved, and the actual demands of users can be met; in addition, the technical scheme of the embodiment of the application is simple and convenient to realize, convenient to popularize and wider in application range.
Example two
Fig. 2 is a second flow chart of the process scheduling plan generating method according to the embodiment of the present application. Further optimization and expansion based on the above technical solution can be combined with the above various alternative embodiments. As shown in fig. 2, the process scheduling plan generation method may include the steps of:
s201, acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1.
S202, calculating the latest starting time of each process in each order according to the delivery deadline of each order.
In this step, the electronic device may calculate the latest start time of each process in each order based on the delivery deadline of each order, on the premise of ensuring the delivery deadline; wherein the time relation between adjacent processes is determined by the processing capability relation between processing equipment of the processes, and the intermediate value is taken when a plurality of equipment exists.
S203, determining processing equipment corresponding to each process according to the latest starting time of each process in each order and the processing time of each process in each order.
In this step, the electronic device may determine the processing device corresponding to each process according to the latest start time of each process in each order and the processing time period of each process in each order. Specifically, the electronic device may calculate the latest start time of each procedure in each order based on the delivery deadline of each order; and then determining the processing equipment corresponding to each process according to the latest starting time of each process in each order and the processing time of each process in each order.
S204, according to the latest starting time of each process in each order and the processing time length of each process in each order, respectively establishing a processing time period for each process in each order.
In this step, the electronic device may establish a processing time period for each process in each order, respectively, based on the latest start time of each process in each order and the processing time period of each process in each order. Specifically, the processing time period corresponding to each process may include: start time and duration; wherein, the starting time of the processing time period is the latest starting time of the working procedure; the duration of the processing time period is the processing duration of the working procedure.
S205, determining processing equipment corresponding to each process according to the processing time period corresponding to each process in each order.
In this step, the electronic device may determine the processing device corresponding to each process according to the processing time period corresponding to each process in each order. Specifically, the electronic device may first establish a first mixed integer programming model according to a processing time period corresponding to each process in each order and a processing device corresponding to each process; and then solving the first mixed integer programming model to obtain processing equipment corresponding to each procedure. Specifically, the first mixed integer programming model in the embodiment of the application is used for solving processing equipment corresponding to each procedure. The first mixed integer programming model may be described as follows:
object set: { I }: representing a process or a set of time periods corresponding to a process; { K }: representing a set of devices;
variable X ik =1: indicating the procedurei is arranged to device k; variable X ik =0: indicating that process i is not scheduled to equipment k;
variable Y ijk =1: indicating that both process i and process j are arranged on device k; variable Y ijk =0: indicating that neither process i nor process j is arranged on device k;
parameter C ijk A penalty value for when both process i and process j are arranged on equipment k, the penalty value being equal to the overlap length of the processing time period corresponding to process i and the processed time period corresponding to process j;
first constraint: sigma (sigma) k X ik For =1Step i, all equipment k capable of processing step i;
second constraint: y is Y ijk ≤X ik ；
Third constraint: y is Y ijk ≤X jk ；
Fourth constraint: y is Y ijk ≥X ik +X jk -1；
Objective function: min ΣC ijk ×Y ijk 。
And solving the model to obtain the processing equipment corresponding to each working procedure.
S206, generating a production schedule of each process in each order according to the latest starting time of each process on each processing device.
The method for generating the procedure scheduling plan provided by the embodiment of the application comprises the steps of firstly obtaining data to be processed; then calculating processing equipment corresponding to each procedure in the data to be processed; determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure; and finally, generating a production schedule of each process in each order according to the latest starting time of each process on each processing equipment. That is, in the technical solution of the present application, the number of processes that need to be processed on each processing apparatus need not be solved, but the processing apparatus corresponding to each process is solved first, and then the latest start time of each process on the same processing apparatus is determined, so that a production schedule of each process in each order can be generated. In the prior art, under the condition that the number of optional processing equipment and the working procedures required to be processed by each processing equipment is not determined, parallel production cannot be realized among different working procedures of the same order, and the next working procedure can only be started after the last working procedure is processed, so that a lot of time is wasted; in addition, if there are too many working procedures on the same equipment, there are many possible production ways. For example, assuming that the total number of procedures is n, the number of constraints required is 1/2×n× (n-1), and the possible production method is a factorial of n, which is difficult to solve in the case of too many procedures, and takes too long to meet the actual requirements. Therefore, compared with the prior art, the process scheduling plan generation method provided by the embodiment of the application can realize parallel scheduling among different processes of the same order, so that the time can be saved, and the actual demands of users can be met; in addition, the technical scheme of the embodiment of the application is simple and convenient to realize, convenient to popularize and wider in application range.
Example III
Fig. 3 is a third flow chart of the process scheduling plan generating method according to the embodiment of the present application. Further optimization and expansion based on the above technical solution can be combined with the above various alternative embodiments. As shown in fig. 3, the process scheduling plan generation method may include the steps of:
s301, acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1.
S302, calculating the latest starting time of each process in each order according to the delivery deadline of each order.
S303, according to the latest starting time of each process in each order and the processing time length of each process in each order, respectively establishing a processing time period for each process in each order.
S304, a first mixed integer programming model is established according to the processing time period corresponding to each procedure in each order and the processing equipment corresponding to each procedure.
And S305, solving the first mixed integer programming model to obtain processing equipment corresponding to each process.
S306, a second mixed integer programming model is established according to all working procedures and all processing equipment.
In this step, the electronic device may build a second mixed integer programming model based on all of the process steps and all of the processing equipment. The second mixed integer programming model may be described as follows:
object set: { I }: representing a process set; { M }: representing a set of devices; { O }: representing an order set;
variable X im The latest start time of the process i on the equipment m; wherein, the equipment to be processed for any procedure i is already determined;
variable Ind ij The indicating variable between two working procedures on the same equipment is 0-1 variable;
variable Ind O Indicating a variable for 0-1 whether order o is overdue;
the parameter T is the time range of the allowable exchange sequence on the same equipment;
the parameter M is a large number and can be set to be more than 3 times of the maximum delivery period;
parameter C O The penalty coefficient for overdue order o may be set to a constant, such as 1000, or different penalties may be set according to the order size or important procedure;
first constraint: x is X im -X jn The assembly line processing time difference between the two working procedures is not less than, wherein the working procedure i is the last working procedure of the working procedure j; m and n are processing equipment corresponding to the working procedure;
second constraint: for both processes i and j on the same equipment, if the latest start time of both processes i and j is less than T, the order can be exchanged:
X im the latest start time of the + procedure i is less than or equal to X jm +Ind ij ×M；
X jm The latest start time of the + procedure i is less than or equal to X jm +(1-Ind ij )×M；
Otherwise, if the latest start time of process j is greater than the latest start time of process i plus T, the constraint is as follows:
X im the latest start time of the + procedure i is less than or equal to X jm 。
Third constraint: whether the order is overdue constraint: for any order o, assuming that the procedure i is the last procedure of the order o and the allocated equipment is m, the constraint is as follows:
X im latest start time of procedure i-Ind O The delivery time of the order o is less than or equal to the x M;
objective function: min ΣC 0 ×Ind O 。
The objective function includes only overdue penalties, and may be added if there are other requirements, such as equipment balance, whole lot order production time requirements, etc.
And S307, solving the second mixed integer programming model to obtain the latest starting time of each process on corresponding processing equipment.
And S308, adjusting the latest starting time of each process on the corresponding processing equipment to obtain the adjusted latest starting time of each process on the corresponding processing equipment.
In this step, the electronic device may adjust the latest start time of each process on the corresponding processing device, to obtain the adjusted latest start time of each process on the corresponding processing device. Specifically, the electronic device may first extract one processing device from all the processing devices as a current processing device; then exchanging the working procedures on the current processing equipment to obtain the adjusted latest starting time of each working procedure on the current processing equipment; the above operations are repeatedly performed until the adjusted latest start time of each process on each processing apparatus is obtained.
Further, if the current processing equipment does not meet the preset processing requirement, determining a current time range according to the previous time range and the preset time length; adjusting the arrangement sequence of the working procedures of the current processing equipment in the current time range; and repeatedly executing the operation until the current processing equipment meets the preset processing requirement.
S309, generating a production schedule of each process in each order according to the latest starting time of each process on each processing device.
The method for generating the procedure scheduling plan provided by the embodiment of the application comprises the steps of firstly obtaining data to be processed; then calculating processing equipment corresponding to each procedure in the data to be processed; determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure; and finally, generating a production schedule of each process in each order according to the latest starting time of each process on each processing equipment. That is, in the technical solution of the present application, the number of processes that need to be processed on each processing apparatus need not be solved, but the processing apparatus corresponding to each process is solved first, and then the latest start time of each process on the same processing apparatus is determined, so that a production schedule of each process in each order can be generated. In the prior art, under the condition that the number of optional processing equipment and the working procedures required to be processed by each processing equipment is not determined, parallel production cannot be realized among different working procedures of the same order, and the next working procedure can only be started after the last working procedure is processed, so that a lot of time is wasted; in addition, if there are too many working procedures on the same equipment, there are many possible production ways. For example, assuming that the total number of procedures is n, the number of constraints required is 1/2×n× (n-1), and the possible production method is a factorial of n, which is difficult to solve in the case of too many procedures, and takes too long to meet the actual requirements. Therefore, compared with the prior art, the process scheduling plan generation method provided by the embodiment of the application can realize parallel scheduling among different processes of the same order, so that the time can be saved, and the actual demands of users can be met; in addition, the technical scheme of the embodiment of the application is simple and convenient to realize, convenient to popularize and wider in application range.
Example IV
Fig. 4 is a schematic structural diagram of a process scheduling plan generating apparatus according to an embodiment of the present application. As shown in fig. 4, the process scheduling plan generating apparatus includes: an acquisition module 401, a calculation module 402, a determination module 403, and a generation module 404; wherein, the liquid crystal display device comprises a liquid crystal display device,
the acquiring module 401 is configured to acquire data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1;
the calculating module 402 is configured to calculate processing equipment corresponding to each process in the data to be processed;
the determining module 403 is configured to determine, according to the processing device corresponding to each process, a latest start time of each process on each processing device;
the generating module 404 is configured to generate a production schedule of each process in each order according to a latest start time of each process on each processing device.
The process scheduling plan generating device can execute the method provided by any embodiment of the application, and has the corresponding functional modules and beneficial effects of the execution method. Technical details not described in detail in this embodiment may be referred to the process scheduling plan generating method provided in any embodiment of the present application.
Example five
Fig. 5 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
As shown in fig. 5, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.
Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the respective methods and processes described above, such as the process scheduling plan generation method.
In some embodiments, the process scheduling plan generation method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as the storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the above-described process scheduling plan generating method may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the process scheduling plan generation method in any other suitable manner (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.
The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (10)
1. A process scheduling plan generation method, the method comprising:
acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1;
calculating processing equipment corresponding to each procedure in the data to be processed;
determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure;
a scheduling plan for each process in each order is generated based on the latest start time of each process on each processing tool.
2. The method according to claim 1, wherein calculating the processing equipment corresponding to each process in the data to be processed comprises:
calculating the latest starting time of each procedure in each order according to the delivery deadline of each order;
and determining processing equipment corresponding to each process according to the latest starting time of each process in each order and the processing time of each process in each order.
3. The method of claim 2, wherein determining the processing equipment corresponding to each process based on the latest start time of each process in each order and the processing time of each process in each order comprises:
establishing a processing time period for each process in each order according to the latest starting time of each process in each order and the processing time length of each process in each order;
and determining processing equipment corresponding to each process according to the processing time period corresponding to each process in each order.
4. A method according to claim 3, wherein determining the processing equipment for each process based on the processing time period for each process in each order comprises:
establishing a first mixed integer programming model according to the processing time period corresponding to each procedure in each order and the processing equipment corresponding to each procedure;
and solving the first mixed integer programming model to obtain processing equipment corresponding to each working procedure.
5. The method of claim 4, wherein determining the latest start time of each process on each process equipment based on the process equipment corresponding to each process comprises:
establishing a second mixed integer programming model according to all working procedures and all processing equipment;
solving the second mixed integer programming model to obtain the latest starting time of each procedure on corresponding processing equipment;
and adjusting the latest starting time of each process on the corresponding processing equipment to obtain the adjusted latest starting time of each process on the corresponding processing equipment.
6. The method of claim 5, wherein adjusting the latest start time of each process on the corresponding processing equipment to obtain the adjusted latest start time of each process on the corresponding processing equipment comprises:
extracting one processing device from all the processing devices as the current processing device;
exchanging the working procedures on the current processing equipment to obtain the adjusted latest starting time of each working procedure on the current processing equipment; the above operations are repeatedly performed until the adjusted latest start time of each process on each processing apparatus is obtained.
7. The method of claim 6, wherein exchanging the process steps on the current process equipment to obtain adjusted latest start times of the respective process steps on the current process equipment comprises:
if the current processing equipment does not meet the preset processing requirement, determining a current time range according to the last time range and the preset time length;
adjusting the arrangement sequence of the working procedures of the current processing equipment in the current time range; and repeatedly executing the operation until the current processing equipment meets the preset processing requirement.
8. A process scheduling plan generating apparatus, comprising: the device comprises an acquisition module, a calculation module, a determination module and a generation module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the acquisition module is used for acquiring data to be processed; wherein the data to be processed comprises M orders; each order includes N procedures; m and N are natural numbers greater than 1;
the calculation module is used for calculating processing equipment corresponding to each procedure in the data to be processed;
the determining module is used for determining the latest starting time of each working procedure on each processing device according to the processing device corresponding to each working procedure;
the generation module is used for generating a production scheduling plan of each process in each order according to the latest starting time of each process on each processing device.
9. An electronic device, comprising:
one or more processors;
a memory for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the process scheduling plan generating method of any one of claims 1 to 7.
10. A storage medium having a computer program stored thereon, wherein the program when executed by a processor implements the process scheduling plan generating method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310423415.9A CN116485130A (en) | 2023-04-19 | 2023-04-19 | Method and device for generating procedure scheduling plan, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310423415.9A CN116485130A (en) | 2023-04-19 | 2023-04-19 | Method and device for generating procedure scheduling plan, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116485130A true CN116485130A (en) | 2023-07-25 |
Family
ID=87222618
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310423415.9A Pending CN116485130A (en) | 2023-04-19 | 2023-04-19 | Method and device for generating procedure scheduling plan, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116485130A (en) |
-
2023
- 2023-04-19 CN CN202310423415.9A patent/CN116485130A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114298322B (en) | Federal learning method and apparatus, system, electronic device, and computer readable medium | |
| CN114428674A (en) | Task scheduling method, device, equipment and storage medium | |
| CN115373860B (en) | Scheduling method, device and equipment of GPU (graphics processing Unit) tasks and storage medium | |
| CN116485130A (en) | Method and device for generating procedure scheduling plan, electronic equipment and storage medium | |
| CN115438007A (en) | File merging method and device, electronic equipment and medium | |
| CN114722048A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN110460987B (en) | Card writing method, device, server and storage medium | |
| CN116468824B (en) | Animation redirection method, device, electronic equipment and storage medium | |
| CN113326890B (en) | Labeling data processing method, related device and computer program product | |
| CN116431698B (en) | Data extraction method, device, equipment and storage medium | |
| CN117057411B (en) | Large language model training method, device, equipment and storage medium | |
| CN117093329A (en) | File generation method, device, equipment and storage medium | |
| CN117193726A (en) | Parallel design method and device of software, electronic equipment and medium | |
| CN117035736A (en) | Maintenance plan generation method, device, equipment and storage medium | |
| CN117472471A (en) | Application program configuration method, device, equipment and storage medium | |
| CN117057040A (en) | Ship design graph generation method, device, equipment and storage medium | |
| CN116627097A (en) | Process recipe management method and device, production equipment system and storage medium | |
| CN117634797A (en) | Production scheduling method and device, electronic equipment and storage medium | |
| CN115098520A (en) | Device data updating method and device, electronic device and storage medium | |
| CN115510838A (en) | Template generation method and device, electronic equipment and storage medium | |
| CN117668114A (en) | Data synchronization method, device, equipment and medium | |
| CN115617811A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN116594708A (en) | Method, device, equipment and medium for generating multi-model loading configuration file | |
| CN117406964A (en) | Data architecture model design method, device, electronic equipment and storage medium | |
| CN116304796A (en) | Data classification method, device, equipment and 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 |