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 8):
The system according to  claim 5 , wherein the step S7 implemented through loading and execution of the at least one instruction by the at least one processing unit comprises:\n step S71, obtaining a nectar source code as current optimal solution, and defining iterations it max, tabu list length tabulong, and neighborhood searches Slong; step S72, randomly generating two positive integers x and y between 1 and n, moving the numerical value of the xth position to the yth position, and then arranging numerical values between the (x+1)th and the yth position to the xth to (y\u22121)th positions of a new code, thereby obtaining a new nectar source code; step S73, repeating the step S72 until Slong new nectar source codes are generated, and calculating the fitnesses of all solutions; step S74, comparing the solution with the best fitness with the current optimal solution; if the solution with the best fitness is superior to the current optimal solution, performing step S76; otherwise, performing step S75; step S75, sorting all the solutions in a descending order, successively checking whether the respective x and y values of the solutions are present in the tabu list until the result for a solution is no, and then performing step S76 with the solution as the best-fit solution; step S76, replacing the current optimal solution with the best-fit solution; determining whether the number of records in the tabu list is greater than tabulong; if yes, deleting the last element in the tabu list, moving each element down by one position, and adding the x and y values corresponding to the best-fit solution to the first position of the tabu list; otherwise, directly moving each element down by one position, and adding the x and y values corresponding to the best-fit solution to the first position of the tabu list; and step S77, with it=it+1, determining whether it\u2264it max is true; if yes, returning to the step S72; otherwise, terminating search.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.0890914195201964
- 35 USC 102 Novelty (BERT): 0.4847863188683903
- Combined Prediction Score: 0.1286609094550158
- Mean Citation Score: 138.43728000000002
- Max Citation Score: 167.02881000000005
- Similarity Product: 118.66401413069492

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