Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Flexible workshop robustness scheduling method based on decomposition multi-target evolution algorithm

A technology of multi-objective evolution and scheduling method, which is applied in the field of flexible workshop robust scheduling based on decomposition multi-objective evolutionary algorithm, which can solve the problems of low scheduling efficiency, unsuitable scheduling scheme, weak local search ability, etc.

Active Publication Date: 2016-09-07
NANJING UNIV OF INFORMATION SCI & TECH
View PDF6 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

They assume that all the information in the flexible job shop is known in advance and fixed. Obviously, when there are uncertain factors in the actual production environment, the scheduling scheme generated by the static method is no longer applicable.
[0007] (2) The processing method for multiple optimization objectives is relatively simple
[0008] (3) The local search ability is weak, it is easy to fall into local optimum, and the scheduling efficiency is low

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 workshop robustness scheduling method based on decomposition multi-target evolution algorithm
  • Flexible workshop robustness scheduling method based on decomposition multi-target evolution algorithm
  • Flexible workshop robustness scheduling method based on decomposition multi-target evolution algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0086] Below in conjunction with accompanying drawing, technical scheme of the present invention is described in further detail:

[0087] In a flexible job shop, there are 5 machines and 4 jobs to be processed. Each process of each job can be processed separately on 5 machines. Among these processes, there are uncertainties in the processing time of some processes. The number of processes included in the four operations and the initial estimated processing time of each process on each allowed processing machine are shown in Table 1.

[0088] Table 1

[0089]

O 11

O 12

O 13

O 21

Estimated processing time

2,5,4,1,2

5,4,5,7,5

4,5,5,4,5

2,5,4,7,8

O 22

O 23

O 31

O 32

Estimated processing time

5,6,9,8,5

4,5,4,54,5

9,8,6,7,9

6,1,2,5,4

O 33

O 34

O 41

O 42

Estimated processing time

2,5,4,2,4

4,5,2,1,5

1,5,2,4,12

5,1,2,1,2

[0090] Using the flexible jo...

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 workshop robustness scheduling method based on a decomposition multi-target evolution algorithm. The method comprises the following steps: 1, reading such input information as operation, machine attributes and the like of a flexible operation workshop, defining an optimization object, and setting constraint conditions; 2, initializing parameters of the algorithm; 3, determining an adjacent domain of each subproblem, generating an initial parent group, and determining all Pereto non-dominant solutions from the initial group so as to form an external memory; 4, generating a child group, carrying out mating selection, breeding child individuals by use of an adaptive variation operator and a restoration-based intersection operator, and updating the external memory; 5, by use of the generated child group, updating a current optimal individual of each subproblem, and forming a new parent group; and 6, when it is determined that the individual object evaluation frequency reaches the maximum, outputting the external memory, i.e., a group of Pareto non-dominant flexible operation workshop scheduling solutions, and if the frequency does not reach the maximum, skipping to the fourth step. According to the invention, scheduling tasks in a flexible operation workshop can be rapidly and efficiency realized.

Description

technical field [0001] The invention relates to the technical field of flexible job shop scheduling control, in particular to a flexible job shop robust scheduling method based on decomposition multi-objective evolutionary algorithm. Background technique [0002] The flexible job shop scheduling problem is a generalization of the classic job shop scheduling problem, and it is a kind of NP-hard problem. In the flexible job shop scheduling problem, one process is allowed to be processed by multiple machines. Therefore, it is necessary to allocate appropriate machines for each process of each job, and determine the processing sequence of processes on each machine to meet various constraints. Under the premise of achieving the shortest completion time of the job, the load balancing of each machine and other optimization goals. [0003] There are many uncertain factors in the production environment of the actual flexible job shop, such as changes in the processing time of some p...

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): G05B13/04
CPCG05B13/04
Inventor 申晓宁韩莹张敏付景枝陈逸菲赵丽玲林屹
Owner NANJING UNIV OF INFORMATION SCI & TECH
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
Eureka Blog
Learn More
PatSnap group products