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

Production scheduling algorithm for solving job shop production problem

A job shop, algorithm technology, applied in computing, computing model, artificial life and other directions, to achieve good real-time effect

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

AI Technical Summary

Problems solved by technology

[0006] In view of the above-mentioned deficiencies in the prior art, the technical problem to be solved by the present invention is to provide a new production scheduling algorithm based on cuckoo search to solve the problem of urgent order processing and optimize the performance of the algorithm to make it more suitable for the actual production environment of the workshop

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

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] The following is attached Figure 1 to 5 , A detailed description of the present invention.

[0029] 1. Combination of trial assembly process in the actual production process Figure 4 The embodiment is described as follows: A number of small labor costs are trial-assembled into a relatively large labor price, and this large workpiece is processed in its process. When it is processed to a certain level (all its processes have not been completed), it needs to be disassembled , Its small parts and workpieces continue to go back to the process that has not been processed at the labor price, and after certain conditions are met, the labor costs are assembled again, and then the subsequent processes required for processing the workpiece are continued. The operation is repeated in sequence until the termination condition is met. The embodiment combines Figure 4 As follows: Workpiece 3 is assembled by work piece 1 and labor cost 2. Workpiece 1 has 5 procedures to be processed, a...

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 production scheduling algorithm for solving a job shop production problem. The algorithm not only solves a problem existing in reasonable resource utilization and scheduling, but also considers constraint condition of an order cycle, so that the algorithm is more accurate and practical. An inventory problem existing in an actual production process is solved, and current inventory limitation is calculated and measured based on average volumes of workpieces, so that the algorithm is relatively practical, high in real-time property, simple and efficient; a calculation way of calculating discovering probability of a foreign bird egg in a cuckoo search algorithm is determined, so that the algorithm is accurate and efficient, and the algorithm is more applicable to an actual production environment; and one of three assumed conditions of the cuckoo search algorithm is broken through: the number of bird nests is unchanged. By considering a condition of increasing number of the bird nests, a processing way of urgency order inserting is set.

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. It has a wide range of application backgrounds, such as manufacturing, traffic regulations, post and telecommunications, large-scale integrated circuit design and other issues. As a kind of allocation problem that satisfies the requirements of task configuration and sequence constraints, JSP has been proved to be a typical NP_hard problem, which is much more difficult to solve than the pipeline scheduling problem. Algorithms for solving job shop scheduling problems have always been an important topic that academia and engineering circles pay attention to. [0004] The competition in the manufacturing industry is becoming increasingly fierce, and companies are moving towards a multi-type, small-batch, and large-volume production model with ...

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/06312G06N3/006
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