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

Novel production scheduling algorithm for solving job shop scheduling problem

A job shop, scheduling problem technology, applied in computing, manufacturing computing systems, instruments, etc., can solve problems such as the problem of not considering the combination of workpieces

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

AI Technical Summary

Problems solved by technology

[0004] Some existing algorithms only solve the bottom-level job scheduling problem, and do not take into account the complex workpiece combination problem in the production process, that is, multiple parts are combined to form a new part, and this new part 1 may also be It will be combined with other workpieces to form a new part 2, and the new part 2 may need to be processed, and then assembled with the new part 3 to form a workpiece, such a cycle problem

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
  • Novel production scheduling algorithm for solving job shop scheduling problem
  • Novel production scheduling algorithm for solving job shop scheduling problem
  • Novel production scheduling algorithm for solving job shop scheduling problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] The algorithm proposed by the present invention solves the complex workpiece combination problems existing in the actual production process such as image 3 As shown, that is, multiple parts are combined to form a new part. This new part 1 may be combined with other workpieces to form a new part 2. The new part 2 may need to be processed and then assembled with a new part 3. An artifact, so cyclical problem.

[0022] The present invention solves the above problems by adopting a new production scheduling algorithm for solving job shop scheduling problems, combining Figure 1 to Figure 3 , the specific implementation process of the algorithm is as follows:

[0023] Step 1: Coding, using process-based coding rules, that is, chromosomes are composed of w×n×m genes, which represent a sequence of processes. In this sequence of processes, each job number appears m times at most, and the chromosomes are composed of A two-dimensional space point (x, y) represents, that is, the...

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 novel production scheduling algorithm for solving a job shop scheduling problem, and solves the complex workpiece combination problem, namely, the problem that a plurality of parts are combined into a new part, the new part 1 is possibly combined with other workpieces to form a new part 2, the new part 2 possibly needs to be processed and is assembled with a new part 3 to form a workpiece, and so on. The same-level production scheduling algorithm is provided and comprises the following main steps of 1: performing encoding: performing encoding by adopting a process-based encoding rule; 2: setting a workpiece priority order La; 3: setting a workpiece priority sequence P (which workpiece belongs to which priority); and 4: if the number of workpieces of a priority is not null, executing the same-level production scheduling algorithm, otherwise, adding 1 to the priority.

Description

technical field [0001] The invention relates to the technical field of job shop scheduling. Background technique [0002] 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 kind of allocation problem that meets the requirements of task configuration and sequence constraints, JSP has been proved to be a typical NP_hard problem, and its solution difficulty is far greater than that of pipeline scheduling problem. Algorithms for solving job shop scheduling problems have always been an important topic of common concern in academia and engineering. [0003] The competition in the manufacturing industry is becoming increasingly fierce, and companies are moving towards multi-type, small-batch, and high-volume production models with d...

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/06G06Q50/04
CPCY02P90/30G06Q10/06316G06Q50/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