PATENT CLAIM ANALYSIS

Application Number: 16127124
Application Type: Utility
Filing Date: 2018-09
Publication Date: 2019-03
Patent Classification: ["705", "007130"]

Abstract:
The present invention disclose a parallel machine batch scheduling method and system based on an improved artificial bee colony algorithm in a deterioration situation. With this method, a near-optimal solution for the parallel machine batch scheduling problem with deteriorating jobs and maintenance consideration can be obtained. The model of the present invention is derived from an actual production process with considerations of machine maintenance and batching as well as additional processing and maintenance time for jobs and machines over time in actual production. According to the present invention, the settlement of this problem is conducive to providing reliable decision support for the production and maintenance of an enterprise in complex real production conditions, thus reducing enterprise operation costs, increasing enterprise productivity, and promoting building of a modern smart factory of the enterprise.

Claim (Index 1):
A production scheduling method based on an improved artificial bee colony algorithm, the method being executed by a computer and comprising:\n S1, inputting the capacity of each machine and general processing time for a job, and setting parameters of the improved artificial bee colony algorithm, including maximum iterations t max , global optimal solution gbest, nectar source search limit UP, number of employed bees SN, and iteration t=1; S2, initializing the population with consideration of total SN nectar sources, with the position of the qth nectar source being defined as X q =(x q 1 , x q 2 , . . . , x q j , . . . , x q n ), q=1, 2, . . . , SN, wherein x q j  represents the position of the qth nectar source in the jth dimension, indicating that the jth job is assigned to machine x q j ; S3, calculating a fitness value of each nectar source in a solution set, and updating the global optimal solution gbest; S4, calculating neighborhood selection probability R a = t t max of the current generation, by setting the variable q=1;\n S5, determining whether rand(0,1) R a  is true; if yes, performing an exchange mutation operation on X q , and retaining the nectar source according to a greedy rule, wherein rand(0,1) represents a random number between 0 and 1; otherwise, performing an inversion mutation operation on X q , and retaining nectar source according to the greedy rule; if the nectar source is updated, up q =0; otherwise, up q =up q +1, wherein up q  represents searches for the qth nectar source; \n S6, with q=q+1, determining whether q\u2264SN is true; if yes, returning to the step S5; otherwise, performing step S7; \n S7, calculating probability \n pro q = 1 \ue89e / \ue89e fit q \u2211 z = 1 SN \ue89e \ue89e 1 \ue89e / \ue89e fit z , wherein fit q  represents the fitness value of the qth nectar source, and smaller fit q  indicates a better solution since the problem to be solved is a minimization problem;\n S8, selecting the qth nectar source from the population with the probability pro q , and performing a tabu search operation; if the nectar source is updated, up q =0; otherwise, up q =up q +1; repeating this operation SN times to update the solution set; \n S9, setting the variable q=1; \n S10, if up q \u2264UP, q=q+1; otherwise, replacing X q  with a randomly generated new solution, and let up q =0, q=q+1; \n S11, determining whether q\u2264SN is true; if yes, returning to the step S10; otherwise, performing step S12; and \n S12, replacing later 20% nectar sources in the solution set with randomly generated nectar sources; let t=t+1; determining whether t\u2264t max  is true; if yes, returning to the step S3; otherwise, terminating the algorithm and outputting the global optimal solution gbest, and outputting optimal job assignment, job batching, batch processing order and starting time of maintenance on each machine.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 97.0
- Lexical Diversity: 1.7625
- Patent Class: 705.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['12805363', '15958932', '12334561', '13046346', '10918336']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.0794886930364961
- 35 USC 102 Novelty (BERT): 0.487862429381372
- Combined Prediction Score: 0.1203260666709837
- Mean Citation Score: 138.43728000000002
- Max Citation Score: 167.02881000000005
- Similarity Product: 113.022341996702

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test