Method for solving job shop process bottleneck problem based on cuckoo search algorithm

A technology of cuckoo search and job shop, which is applied in the field of algorithm to solve the process bottleneck problem of job shop. The effect of reducing iterative search time and reducing the amount of calculation

CN106611382AInactive Publication Date: 2017-05-03SICHUAN YONGLIAN INFORMATION TECH CO LTD
0 Cites 8 Cited by

Patent Information

Authority / Receiving Office
CN · China
Current Assignee / Owner
Publication Date
2017-05-03
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention provides a method for solving a job shop process bottleneck problem based on a cuckoo search algorithm. Bottleneck resources are judged by using the TOC principle, and the processing scheduling of shop bottleneck process is optimized by using an improved cuckoo search algorithm. According to the method provided by the invention, the work scheduling of the bottleneck process is optimized targetedly, thereby avoiding a lot of unnecessary optimization processes, accelerating the execution speed of the algorithm and meanwhile improving the solution accuracy of the algorithm; bird nest groups are classified by using an improved K_means algorithm, and then optimized scheduling is carried out the clusters by using the improved cuckoo search algorithm, thereby reducing the calculation amount of the algorithm on one hand, and effectively improving the solution accuracy of the algorithm on the other hand; and the difference of bird nests is expressed by safety and flight time consumption, the safety is expressed by random number, and the flight time consumption is expressed by geographic positions, thereby being simple and effective, applicable to the actual conditions and easy to understand.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of dispatching, in particular to using an algorithm to solve the process bottleneck problem of a job shop. Background technique

[0002] In the entire operation process of an enterprise, there is always a certain link that restricts the production and sales rate of the enterprise, which we call "bottleneck". The goal of the enterprise is to earn more profits now or in the future, so it is necessary to continuously improve and break through, so that the bottleneck will no longer be an obstacle to the enterprise's income increase. But in the process of improvement, the old bottlenecks disappear, and new bottlenecks will appear again. Therefore, for enterprises, the transformation and breakthrough of the bottleneck is a process of repeated and continuous improvement.

[0003] Through the analysis of the above definitions, it can be found that when judging whether a resource is a bottleneck resource, there are the follo...

Examples

Embodiment Construction

[0047] In order to make the purpose, technical solution and advantages of the present invention more clear, the following will be described in detail and specifically in conjunction with the algorithm flow chart.

[0048] 1. Mathematical description of the bottleneck

[0049] For n resources in the system X={X 1 , X 2 ,...,X n}, the actual output capacity C = {C 1 , C 2 ,...,C n}, the external demand of the system MR={MR 1 , MR 2 ,...,MR n}. There is an association relationship R between guard input and output among some resources. Assumptions and Resources X i The set of associated resource labels is S, namely

[0050]

[0051] Then, if and only if

[0052]

[0053] , resource X i is the bottleneck resource, output capacity C i , external demand MR i .

[0054] 2. An algorithm to solve the bottleneck problem of workshop scheduling process

[0055] Step 1: Identify the bottleneck: The identification method of the bottleneck is as follows:

[0056] Step 1....