Improved cuckoo search algorithm for solving job-shop scheduling problem

A cuckoo search and job shop technology, applied in the field of job shop scheduling, can solve the problems of insufficient algorithm application range, insufficient algorithm search speed, and insufficient calculation accuracy, achieving high practicability, simple calculation method, and wide application range Effect

Inactive Publication Date: 2017-05-03
SICHUAN YONGLIAN INFORMATION TECH CO LTD
View PDF0 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The traditional cuckoo algorithm has a good global optimal search ability, and the algorithm parameters are few and easy to implement, but the search speed of the algorithm is not fast enough, the calculation accuracy is not high enough, the application range of the algorithm is not large enough, and the search vitality is not enough

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
  • Improved cuckoo search algorithm for solving job-shop scheduling problem
  • Improved cuckoo search algorithm for solving job-shop scheduling problem
  • Improved cuckoo search algorithm for solving job-shop scheduling problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] In order to make the purpose, technical solution and content of the invention clearer, the following detailed description will be given in conjunction with the accompanying drawings.

[0025] Step 1: Initialize the basic parameters of the algorithm: set the number of bird nests (number of workpieces) N, and the host finds foreign

[0026] The probability Pa of the bird egg (job preemption probability), and the maximum number of iterations MaxT or search accuracy ε:

[0027]

[0028] Wherein, n is the bird's nest (workpiece) quantity of the L priority;

[0029] Step 2: Initialize the position of the bird's nest (the completion time of workpiece processing): according to the order cycle T o , the order received

[0030] Yi R, three aspects of the length of workpiece processing time to determine the initial position of the bird's nest, the specific way is as follows:

[0031]

[0032] Among them, R is the income obtained from completing the order, and no is the nu...

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 an improved cuckoo search algorithm for solving a job-shop scheduling problem. A calculation way of a foreign bird egg in the cuckoo search algorithm is determined, so that the algorithm is accurate and efficient, and the algorithm is more applicable to an actual production environment; on the aspect of an application of the cuckoo search algorithm in solving the job-shop scheduling problem, a calculation way of calculating an initial position of a bird nest is determined, so that the algorithm result is more accurate, and meanwhile, the calculation method is simple, convenient and efficient; and in addition, one of three assumed conditions of the cuckoo search algorithm is broken through: the number of bird nests is unchanged. On the basis of considering a condition of increasing number of the bird nests, a condition of decreasing of the number of the bird nests is also taken into consideration, so that the algorithm is wider in application range; and a calculation method for estimating order completion time is determined.

Description

[0001] Field [0002] The invention relates to the technical field of job shop scheduling. Background technique [0003] Job-shop scheduling problem (Job-shop Scheduling Problem) is a simplified model of many actual production scheduling problems, and has a wide range of application backgrounds, such as manufacturing, traffic rules, post and telecommunications, large-scale integrated circuit design and other issues. As a class of allocation problems that meet the requirements of task configuration and sequence constraints, JSP has been proven to be a typical NP_hard problem, and its difficulty in solving is far greater than that of pipeline scheduling problems. Algorithms for solving job shop scheduling problems have always been an important topic of common concern in academia and engineering. [0004] Many existing algorithms are used to solve the JSP problem, including genetic algorithm, particle swarm algorithm, etc., but none of them can directly use the attributes of job...

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/06G06N3/00
CPCG06Q10/0631G06N3/006
Inventor 姜艾佳胡成华
Owner SICHUAN YONGLIAN INFORMATION TECH 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