A Genetic Scheduling Method Based on Combination Production and Equipment Failure Constraints
A technology of equipment failure and scheduling method, which is applied in the field of automatic control, can solve problems such as machine failure, and achieve the effect of shortening time and shortening scheduling delay
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Publication Date
- 2022-07-19
Smart Images

Figure 1 
Figure 2
Abstract
Description
technical field
[0001] A genetic scheduling method based on combined production and equipment failure constraints is used in the workshop flexible job scheduling technology, and the invention relates to the technical field of automatic control. Background technique
[0002] Aiming at the planning and scheduling problems in the operation of various processing production lines under the intelligent manufacturing mode, major research institutions and the industrial world are focusing on research on production planning and scheduling and intelligent scheduling technology methods. The existing research methods are mainly based on the application of heuristic algorithms. Including meta-heuristic scheduling algorithm, scheduling algorithm based on genetic algorithm, scheduling algorithm based on particle swarm optimization, scheduling algorithm based on deep reinforcement learning, and multi-objective scheduling algorithm, etc. The meta-heuristic algorithm is the first to propose a...
Examples
Embodiment
[0044] like Figure 1-2 As shown, a genetic scheduling method based on combined production and equipment failure constraints includes the following steps:
[0045] Step 1. Propose a job constraint graph model, and use a multi-pre-order job constraint graph to clearly represent the correlation and dependencies between each job; the job constraint graph model is a bidirectional directed graph, that is, a virtual j 2 Job represents a combined production job, node P ij represents the jth process of the ith job, and each node has one or more forward edges connecting each job; P 0i and P 1j respectively represent the actual work j 0 and j 1 virtual combined production process, avoid repeated scheduling during scheduling, that is, whether a process is running on a machine at a certain time, it needs to depend on the inventory of the direct previous process of the process. Schedule, otherwise it is not allowed to be scheduled at this time, such as formula 1:
[0046] ,
[004...