Flexible job shop scheduling method based on dynamic decoding mechanism

A workshop scheduling and flexible operation technology, applied in genetic models, genetic rules, instruments, etc., can solve problems such as dynamic adjustment, poor solution accuracy, and easy to fall into local optimum

Pending Publication Date: 2020-02-14
JIANGSU JINLING INST OF INTELLIGENT MFG CO LTD
View PDF2 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the process of crossover operation and mutation operation is too random, and ideal optimization results may not be obtained only by changing the probability of crossover and mutation
Such operations are not dynamically adjusted according to the current state of the population, which leads to slow solution speed of the algorithm, poor solution accuracy, and easy to fall into local optimum

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
  • Flexible job shop scheduling method based on dynamic decoding mechanism
  • Flexible job shop scheduling method based on dynamic decoding mechanism
  • Flexible job shop scheduling method based on dynamic decoding mechanism

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0147] The present invention further verifies the validity of the dynamic decoding mechanism and the improved algorithm by solving a processing instance in a workshop of a machinery manufacturing enterprise. There are 9 workpieces to be processed in the workshop. Each workpiece has 8 processing procedures and 6 processing machines. The specific processing time is shown in Table 4. All algorithm codes are written on the MATLAB R2012a platform and run on a Core-i5 (3.2GHz) personal computer. The parameters of the algorithm are set as follows: SN is 100, p c is 0.8, p m is 0.2, and the number of iterations is 100.

[0148] Table 4 Example of workshop processing in a machinery manufacturing enterprise

[0149]

[0150]

[0151] For this example problem, the improved algorithm is independently run 10 times under the same test environment. The non-dominated solution set obtained after algorithm optimization is shown in Table 5, and the Pareto solution set distribution diag...

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

No PUM Login to view more

Abstract

The invention discloses a flexible job shop scheduling method based on a dynamic decoding mechanism. The invention relates to the technical field of flexible job shop scheduling. According to the flexible job shop scheduling method based on the dynamic decoding mechanism, improved MOGA is adopted for solving, and an improved workpart-priority-based crossover method, an insertion variation method and an initialized population strategy are integrated, so that optimal design of multi-target flexible job shop scheduling is completed. According to the technical scheme, the method comprises the following steps: 1) modeling; the method comprises the steps of (1) establishing a dynamic decoding mechanism, (2) initializing a population, (3) carrying out genetic manipulation, and (4) updating an external Pareto solution set, and proving that after the dynamic decoding mechanism is applied, an improved algorithm can obtain richer non-dominated solutions and higher-quality non-dominated solutions,and then the optimal design of multi-target flexible job shop scheduling is completed.

Description

technical field [0001] The invention relates to the technical field of flexible job shop scheduling. Background technique [0002] The job shop scheduling problem refers to the processing of n workpieces on m machines, the processing technology of each workpiece has been determined before processing, each process of each workpiece has a specific processing machine, and the processing time of the specified process is also determined , the purpose of the research is to sequence the processing steps of all workpieces on the machine and optimize specific performance indicators. However, the flexible job shop scheduling problem is also that n workpieces are processed on m machines. The difference is that the job shop scheduling problem is that each job processing procedure has a fixed processing machine and processing time. Flexible Job Shop Scheduling Problem The processing machines for each process of the workpiece are uncertain, and all processes have more than one machine th...

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
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/06G06F30/20G06N3/12
CPCG06Q10/06316G06N3/126
Inventor 刘峰汪孝胜陶凌峰李茂盛高磊洪鹏吕向峰刘哲金磊张斌
Owner JIANGSU JINLING INST OF INTELLIGENT MFG CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap