Immune clone selection job shop scheduling method based on scheduling coding

A job shop and immune cloning technology, applied in the computer field, can solve the problems of reduced search efficiency, loss of redundancy diversity, and inability to quickly obtain high-quality job shop scheduling schemes, so as to eliminate coding redundancy and increase diversity. , the effect of shortening the production cycle

Inactive Publication Date: 2011-10-19
XIDIAN UNIV
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Since the population space is limited, redundancy will lead to the loss of diversity, so the search effi

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
  • Immune clone selection job shop scheduling method based on scheduling coding
  • Immune clone selection job shop scheduling method based on scheduling coding
  • Immune clone selection job shop scheduling method based on scheduling coding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] refer to figure 1 , the specific implementation process of the present invention is as follows:

[0030] Step 1: Input the processing procedure information and constraints of machines and jobs, and use the GT algorithm proposed by Giffler and Thompson to operate on the above information to generate a scheduling matrix.

[0031] The present invention takes the length of the assembly line production cycle as the main performance evaluation index, and needs to meet the following conditions: each process must be processed continuously until the process is completed on a designated machine; for each operation, each process must The sequence of processing is given in advance; each operation passes through all machines in its own flow mode and is independent of other operations; each machine can only process one process at a time, and each operation can only be processed in one process at a time. Each job can be processed on one machine only once.

[0032] Step 2, directly e...

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 an immune clone selection job shop scheduling method based on scheduling coding, mainly aiming at overcoming the disadvantages that the quality is poor and the efficiency is low in the prior art when a job shop scheduling problem is solved. The method comprises the following steps: operating an input machine, operation and a constraint condition by utilizing a GT (Guo Tao) algorithm to generate a scheduling matrix; carrying out direct coding to the scheduling matrix to be used as antibody population; calculating the affinity of the antibody population and dividing the antibody population into a memory unit and a free unit; calculating the clone scale of each antibody; carrying out clone variation to the antibody population by using a clone operator based on neighborhood search according to the clone scale to obtain the clone population; carrying out clone selection to the clone population to obtain new antibody population, and carrying out updating and death to the memory unit and free unit; outputting the optimal antibody in the antibody population and mapping the optimal antibody as the scheduling sequence of the machine and the operation. The immune clone selection job shop scheduling method has the advantages of good quality and high efficiency, and can be used for solving the problem of job shop scheduling.

Description

technical field [0001] The invention belongs to the field of computer technology, and relates to an application of natural computing technology in scheduling problems, in particular, based on a scheduling coded cloning operator, the immune cloning selection algorithm is used to solve the job shop scheduling problem. Background technique [0002] Job shop scheduling (JSSP) is the problem of allocating competing assembly line operations to machines that can be shared in time. It is the core of system manufacturing, industrial planning and operational research technology development. The research and application of scheduling methods and optimization techniques have become the basis and key to the practice of advanced manufacturing technology. The application of scheduling problems is not limited to computers and manufacturing, but also includes transportation, service and other industries. In addition, the job shop scheduling problem is a typical NP-hard problem, and seeking a...

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): G06Q10/00
Inventor 刘芳戚玉涛焦李成张晓琳公茂果郝红侠李阳阳尚荣华马文萍常伟远
Owner XIDIAN UNIV
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