Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for dynamically re-dispatching job shop multi-process routes in batches based on two-stage differential evolution algorithm

A differential evolution algorithm and job shop technology, applied in genetic models, comprehensive factory control, comprehensive factory control, etc., can solve problems such as unbalanced capabilities

Inactive Publication Date: 2009-12-23
ZHEJIANG UNIV OF TECH
View PDF0 Cites 27 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the problems that the existing technology cannot effectively solve the large-scale scheduling problem of multi-variety, medium and small batch production workshops in a dynamic and changeable environment, the production cycle is long and the production efficiency is low, the present invention provides a cycle-based and event-driven multi-process route batch The dynamic rescheduling method, considering that the mutation operation of the differential evolution algorithm has the characteristics of keeping the sum of gene values ​​unchanged and the possible imbalance of capabilities between parallel machines in each process of the workpiece, effectively solves the problem of multi-variety, small and medium-sized Mass production workshop large-scale scheduling problem, shorten production cycle, improve production efficiency

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
  • Method for dynamically re-dispatching job shop multi-process routes in batches based on two-stage differential evolution algorithm
  • Method for dynamically re-dispatching job shop multi-process routes in batches based on two-stage differential evolution algorithm
  • Method for dynamically re-dispatching job shop multi-process routes in batches based on two-stage differential evolution algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0083] In combination with the technical scheme and the accompanying drawings, the specific implementation manner of the present invention will be described in detail.

[0084] Refer to attached Figure 1 to Figure 8 , a batch dynamic rescheduling method for multi-process routes in a job shop based on a two-level differential evolution algorithm, including the following steps:

[0085] Step 1: Determine whether the clock counter reaches the cycle time point, if it reaches the cycle time point, take this time point as the rescheduling time starting point t 0 , execute step 2; otherwise, judge whether there is an emergency event, if an emergency event occurs, take the event occurrence time as the starting point of rescheduling time and execute step 2.

[0086] The dynamic environment studied by the present invention includes the following emergencies: the machine is suddenly damaged; the damaged machine is repaired; the order information is changed and so on.

[0087] Step 2: ...

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 provides a method for dynamically re-dispatching job shop multi-process routes in batches based on a two-stage differential evolution algorithm, relating to the evaluation of a re-dispatching parameter, the construction of a dispatching model and the compilation of a dispatching proposal. The method comprises the following steps: setting up a multi-process routes batching dispatching model based on a period and event driven re-dispatching strategy, and providing the two-stage differential evolution algorithm to solve the model, so as to solve the problems of batching dividing and dispatching optimizing. Considering the condition that each work procedure of work pieces possibly has uneven capability in real environment, the method divides the each work piece in batches at the each work procedure, and the designed two-stage differential evolution algorithm solves the problems of batching dividing and dispatching optimizing, so as to effectively reduce the free time of a machine, shorten a production period, and be completely suitable for complex environment change in the process of machining and real-time treatment.

Description

technical field [0001] The invention belongs to the technical field of advanced manufacturing and automation, and relates to a batch dynamic rescheduling method for multiple process routes in a job shop. Background technique [0002] In the actual manufacturing environment, due to the market's demand for individualized products and the variability of the market, multi-variety, small and medium-sized batch production methods have gradually become the mainstream of the development of the manufacturing industry. In this mode of production, if a single part is regarded as an independent individual during scheduling, the scale of the scheduling problem will become very large and the solvability is not good. One solution is to classify all parts of the same type into one category when making a production plan. That is to say, the same kind of parts are combined into a batch as a job in the scheduling problem. The batch of parts is produced together, and each part is processed inde...

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
IPC IPC(8): G05B19/418G06N3/12
CPCY02P90/02
Inventor 赵燕伟王海燕王万良徐新黎赵澄戴欣华
Owner ZHEJIANG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products