The invention belongs to the technical field of
job shop scheduling, and particularly relates to a self-learning
job shop scheduling method meeting
waiting time constraint, which comprises the following steps: S0, constructing a
job shop scheduling problem model with
waiting time constraint; the method comprises the following steps: S1, acquiring
job shop scheduling problem data, a configuration
algorithm and operation parameters; s2, constructing
chromosome individuals, generating chromosomes and initializing a
population; s3, calculating the fitness value of each
chromosome individual; s4, forming a new generation of
population; s5, combining the fitness information of the current
population, dynamically selecting a
crossover rate Pc through a
Q learning algorithm, and performing
crossover operation on the population; s6, dynamically determining a
mutation rate Pm in the same parameter combination space by using a
Q learning algorithm, and performing
mutation operation on the
crossover progeny to generate an updated population; and S7, judging whether an iteration termination condition is met or not. According to the method, a feasible and near-
optimal scheduling scheme can be efficiently generated on the premise of ensuring that the inter-process
waiting time constraint is met.