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

Critical path-combined hybrid neighborhood search algorithm for job-shop scheduling

A critical path and job shop technology, applied in the field of job shop scheduling combination optimization, can solve problems such as computing time and memory limitations, insufficient diversity, complex combination of multiple algorithms, etc., to save time cost and memory cost, and avoid duplication Search, avoid the effect of neighborhood movement

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

AI Technical Summary

Problems solved by technology

[0004] The problems solved by this algorithm are: first, the combination of multiple algorithms will be more complex, resulting in the limitation of computing time and memory; second, the single generation method of the neighborhood solution results in insufficient diversity of solutions; third, the neighborhood search is easy Trapped in local optimum; Fourth. Some neighborhood exchanges will produce infeasible solutions; Fifth. During the search process, the previously checked solution may be repeated

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
  • Critical path-combined hybrid neighborhood search algorithm for job-shop scheduling
  • Critical path-combined hybrid neighborhood search algorithm for job-shop scheduling
  • Critical path-combined hybrid neighborhood search algorithm for job-shop scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0013] 1. Job shop scheduling problem description

[0014] combine figure 1 Represents a 3*3 JSP instance, the job shop problem (JSP) can be described as n workpieces {J i |(i=1, 2, ..., n)} on m machines {M k |(k=1, 2,..., m)} upper processing, O ik Indicates the workpiece J i On device M k The upper processing procedure. Constraints that need to be met during workpiece processing include: Process O ik The processing time p ik It is known in advance, and there is no process preemption, that is, once the process starts processing on the machine, it cannot be interrupted until it is completed; J i Can only be processed on one device at a time; M k Only one workpiece can be processed at a time. The goal is to satisfy all priority and capacity constraints, and to determine the starting processing time (rt ik ≥0).

[0015]

[0016] Constraints: rr jk -rt ik ≥p ik (i, j) ∈ J, k ∈ M

[0017] rt jk -rt ik ≥p ik ∪rt jk -rt ik ≥p ik

[0018] rt ik ≥0

[0019]...

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 critical path-combined hybrid neighborhood search algorithm for job-shop scheduling. The algorithm comprises the contents of generating an initial solution by adopting a priority scheduling rule; combining a critical path, a key block and a tabu list and generating a new solution by adopting multiple neighborhood structures; carrying out infeasible estimation on the new solution; and mining a solution with a deeper range in a search space by adopting an improved critical path. A critical path-combined hybrid heuristic neighborhood search algorithm is provided, balancing of the advantages of various heuristic algorithms is achieved, and the problem of complicated shop scheduling combination optimization of an actual job shop is better solved.

Description

[0001] Technical field [0002] The invention belongs to the field of job shop technology and is used for solving the problem of job shop scheduling combination optimization. Background technique [0003] The job shop scheduling problem is one of the hardest combinatorial optimization problems. Since the problem was raised, many optimization algorithms and heuristic approximation algorithms have been developed. For example: integer linear programming, branch and bound method, domain search algorithm, mobile bottleneck process, simulated annealing algorithm, genetic algorithm, artificial neural network algorithm, etc. Historical research has found that using one heuristic method alone is not as good as a hybrid algorithm combining two or more methods, such as: improved neighborhood search algorithm, genetic algorithm combined with local search, tabu search combined with mobile bottleneck process, etc. Great results were achieved. However, the complexity of actual job shop sc...

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): G06Q50/04
CPCY02P90/30G06Q50/04
Inventor 龚晓慧胡成华
Owner SICHUAN YONGLIAN INFORMATION TECH CO LTD
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