A two-objective multi-workshop comprehensive scheduling method considering migration
A scheduling method, workshop technology, applied in data processing applications, forecasting, instruments, etc., can solve problems such as no consideration
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0033] A two-objective multi-workshop comprehensive scheduling method considering migration, using a multi-shop fuzzy optimization model, first takes the leaf nodes of the process tree as the candidate process set, and secondly, determines the pre-scheduled process and pre-scheduled process according to the long-path priority strategy and the short-time strategy. Scheduling process set, and then determine the real scheduling process set of the same idle equipment according to the process selection strategy of the same equipment in the workshop, and finally select the multi-objective optimization branch strategy according to the process workshop to obtain complex single-product processes assigned to multi-workshop processing, in multiple objectives The optimal scheme among various schemes considering migration under influence.
Embodiment 2
[0035] The two-objective multi-workshop comprehensive scheduling method considering migration, the specific implementation steps of the comprehensive scheduling method are as follows:
[0036] Step 1: Pre-judge the branches of the root node of the processing tree, and determine the first workshop and special process of each branch;
[0037] Step 2: Schedule the processes in the set of actual scheduling processes in order according to the length of the path from long to short. If the pre-judged workshops of the same group of scheduled processes are different, give priority to putting the processes in the pre-judged workshops for processing;
[0038] Step 3: If the pre-judged workshops of the same group scheduling process are the same, they will be assigned in sequence according to the long-path priority strategy, and the remaining workshops will be allocated to processes with lower priority;
[0039] Step 4: If migration occurs, each migration process is used as a node, and the...
Embodiment 3
[0049] The processing process tree is a set of processes that are constrained by the order of processing among them. One of the nodes is a process, and the straight line with the arrow represents the partial order relationship of processing. The numbers in the nodes represent the name of the process and the processing equipment in sequence. number and processing time, for example: J15 / M3 / 4 means that the process is J15 process, the processing equipment number is M2, and the processing time is 4 hours.
[0050] The number of processes of the same type of equipment is different from the number of equipment, the number is determined according to the number of equipment, and the process is determined according to the strategy of long path priority and short time usage.
[0051] The two-objective multi-workshop comprehensive scheduling method considering migration is characterized in that: for multiple objective problems, a proportion value is set for each objective function, and the ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


