Improved cuckoo search algorithm for solving scheduling problem of workshop

Abstract

The invention proposes an improved cuckoo search algorithm for solving a scheduling problem of a workshop, and the algorithm makes the following improvements on the problems that a conventional cuckoo algorithm is slow in search speed, is low in calculation precision and is not strong in search activity: 1, arranging initial positions of nests according to a rising trend, so the algorithm is simple and ordered and reduces the iteration search time; 2, solving JSP through a coding rule based on a working procedure, and attributing workpiece parameters, so the algorithm is simple and clear, is high in practicality and also improves the search capability; 3, solving a cuckoo search step through a method based on a mean value, thereby reducing the search time of the algorithm, and improving the precision of the algorithm in solving the JSP.

Description

[0001] Field [0002] The invention relates to the technical field of job shop scheduling. Background technique [0003] At present, the competition in the manufacturing industry is becoming increasingly fierce, and manufacturing companies are developing towards multi-type and small-batch production models with different completion times and product requirements. How to use existing resources to meet various constraints required by processing tasks, so that all tasks can be completed on time as much as possible, that is, how to effectively solve the Job Shop Scheduling Problem (JSP), has become a very realistic and urgent problem. High-efficiency scheduling algorithms can greatly improve production efficiency and resource utilization, thereby enhancing the competitiveness of enterprises, so the research on JSp has very important theoretical and practical value. [0004] At present, the research and design of efficient algorithms is still an important research content in the f...

AI Technical Summary

Problems solved by technology

[0006] Although the existing cuckoo algorithm has a good global optimal search ability and has the advantages of less algorithm parameters and easy implementation, however, for the optimization of job shop scheduling problems, the cuckoo search algorithm has slow search speed and low calculation accuracy. Vitality is not strong enough

Moreover, in the workshop scheduling problem, there is no algorithm that can directly use the attributes of the workshop operations as parameters, and finally obtain a set of clear solutions to the workshop scheduling scheme

Images