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

A Production Scheduling Method for Flexible Job Shop Based on Particle Swarm Optimization

A particle swarm algorithm and flexible operation technology, applied in computing, computing models, artificial life, etc., can solve problems such as low efficiency and poor scheduling plan target values

Active Publication Date: 2022-07-19
HUBEI UNIV OF TECH
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a production scheduling method for a flexible job shop to solve the problem of poor target value and low efficiency of the scheduling scheme obtained by using the existing method

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
  • A Production Scheduling Method for Flexible Job Shop Based on Particle Swarm Optimization
  • A Production Scheduling Method for Flexible Job Shop Based on Particle Swarm Optimization
  • A Production Scheduling Method for Flexible Job Shop Based on Particle Swarm Optimization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0071] The implementation process of the present invention is as follows figure 1 shown, including the following steps:

[0072] Step 1: Based on the basic parameters of FJSP, an initial population of particles is generated, and the particles in the population generate initial spatial positions.

[0073] The FJSP problem can be described as: arrange n workpieces to be processed on m machines. Workpiece J i (1≤i≤n) includes n j a sequential process. Process O ij The processing time on machine k (1≤k≤m) is recorded as P ijk . Process O can be executed in m machines ij The set of machines is denoted as M ij . The FJSP problem is to assign all the operations to the appropriate machines and to determine the start and finish times of the operations. Table 1 is an example of FJSP, which describes the processing time of 3 workpieces on 3 machines. "—" indicates that a certain procedure cannot be processed on the corresponding machine.

[0074] Table 1 Examples of FJSP quest...

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 present invention is a flexible job shop production scheduling method based on particle swarm optimization algorithm, which is characterized by comprising the following steps: step 1, based on the basic parameters of FJSP, an initial population of particles is generated, and the particles in the population generate initial spatial positions; step Second, encode the spatial positions of the particles in the initial population; step three, decode the spatial positions of all particles, and calculate the target value; step four, calculate the fitness of each particle; step five, re-assign the movement of the particles Step 6: Update the historical optimal solution of individual particles; Step 7: Set the global optimal solution; Step 8: Move the population particles one step; Step 9: Determine whether the maximum number of iterations is reached. The invention solves the problems that the target value of the scheduling scheme obtained by using the existing method is poor and the efficiency is low.

Description

technical field [0001] The invention relates to the technical field of scheduling of flexible job shops, in particular to a scheduling method of flexible job shops optimized for multiple objectives. Background technique [0002] With the improvement of customer demand and the development of production system, the scheduling problem has attracted the continuous attention of researchers. The Flexible Job Scheduling Problem is one of the widely studied problems in modern production systems. FJSP can be decomposed into two sub-problems: the sorting sub-problem and the assignment sub-problem. The sorting sub-problem is the problem of arranging the processing sequence of all the processes on a certain machine; the allocation sub-problem is to select one of several machines to process a certain process. FJSP is a typical NP problem, which cannot be solved by traditional exact algorithms, such as integer programming method, Langerian relaxation method, branch and bound method, etc...

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 Patents(China)
IPC IPC(8): G06Q10/04G06Q10/06G06Q50/04G06N3/00
CPCG06Q10/04G06Q10/0631G06Q50/04G06N3/006Y02P90/30
Inventor 刘炜琪胡新宇游达章魏琼严明霞
Owner HUBEI 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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com