Job shop scheduling scheme robust optimization method based on non-forced idle time
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A technology of idle time and scheduling schemes, applied in genetic models, genetic rules, instruments, etc., can solve problems such as optimization of robust scheduling schemes in job shops
Pending Publication Date: 2020-01-17
XINJIANG UNIVERSITY
View PDF6 Cites 2 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0005] The present invention provides a robust optimization method for a job shop scheduling scheme based on non-forced idle time, which overcomes the above-mentioned deficiencies in the prior art, and can effectivel
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0067] Embodiment 1: as attached figure 1 As shown, the robust optimization method for job shop scheduling based on unforced idle time includes the following steps:
[0068] S1, generate an initial population according to the scheduling basic data, and the initial population includes several original scheduling schemes;
[0069] When generating the initial population based on the scheduling basic data, it is necessary to perform data preprocessing on the scheduling basic data. The data preprocessing process includes a, obtaining order data, delivery date, process route of each workpiece, processing time of each process in the workpiece, Probability distribution of machine failure and maintenance time; b. Organize the obtained data into the standard format required for scheduling, and organize and generate the initial population; the above initial population is the set of original scheduling schemes.
[0070] S2, optimize the individuals in the initial population based on robu...
Embodiment 2
[0157] Embodiment 2: as attached Figure 6 , 7 , as shown in Table 1, this method designs performance robustness degradation rate (Performancerobustness degradation rate, PRDR), stable robustness improvement rate (Stable robustness improvement rate, SRIR), scheduling target improvement rate (Comprehensive improvement rate, CIR) three The indicators are as follows:
[0158] 1. Performance robustness degradation rate PRDR(S 1 ,S 2 ), which means that under the machine failure environment, S 1 and S 2 Relative ratio of performance robustness.
[0159]
[0160] Among them, when PRDR(S 1 ,S 2 )>0, it means S 1 relative to S 2 Deterioration has occurred, PRDR(S 1 ,S 2 ) The larger the degree of deterioration is, the more serious it is.
[0161] 2. Stable robustness improvement rate SRIR(S 1 ,S 2 ), which means that under the machine failure environment, S 1 and S 2 Relative ratio of stability robustness.
[0162]
[0163] Since the non-mandatory idle time can ...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention relates to the technical field of job shop scheduling, in particular to a job shop scheduling scheme robust optimization method based on non-forced idle time. The job shop scheduling scheme robust optimization method comprises the following steps: generating an initial population according to scheduling basic data; constructing an initial scheduling scheme set, and outputting the initial scheduling scheme set in a mode of a process association network graph; inserting non-forced idle time into the initial scheduling scheme set to obtain a scheduling scheme set in which the non-forced idle time is inserted; and evaluating the robustness of each scheduling scheme in the scheduling scheme set inserted with the non-forced idle time, and outputting an optimal scheduling scheme. According to the job shop scheduling scheme robust optimization method, the genetic algorithm is adopted to optimize the weighting target; reasonable non-forced buffer time is added for processes with different influences; robustness evaluation is carried out on a scheduling scheme set inserted with non-forced idle time; an optimal scheduling scheme is output; the scheduling stability is effectivelyimproved; and meanwhile, it can be guaranteed that the degree of degradation of scheduling performance is small, and a more stable scheduling scheme is provided for workshop production.
Description
technical field [0001] The invention relates to the technical field of job shop scheduling, and is a robust optimization method for a job shop scheduling scheme based on non-forced idle time. Background technique [0002] The definition of the job shop can be described as: the job shop scheduling problem can be described as: n workpieces are processed on m machines, and each job J i (i=1,...,n) contains m processes, there are process constraints between processes, and each workpiece only passes through each machine M j (1,...,m) once; O i,j Indicates the workpiece J i on machine M j Upper processing procedure, O i,j The processing time p i,j is a constant. The workpiece arrives at time 0, and all machines are available before starting work. Each machine can only process one workpiece at a time, and each workpiece can only be processed on one machine at a time. The pre-production scheduling plan has been formulated, and the processing order of the processes on the mach...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more