PATENT CLAIM ANALYSIS

Application Number: 16006769
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-12
Patent Classification: ["705", "007130"]

Abstract:
The present invention discloses a method and system for collaborative scheduling of production and transportation in supply chains based on improved particle swarm optimization. The method includes the following steps: 1. setting algorithm parameters; 2. randomly generating an initial population; 3. correcting codes; 4. calculating fitness values and updating the speed and the position of particles; 5. performing tournament selection; 6. performing crossover mutation; 7. updating the population; and 8. determining whether a termination condition is satisfied; if so, outputting a globally optimal solution; if not, returning to the step 3. In the present invention, an approximately optimal solution can be obtained in view of the collaborative scheduling problem of production and transportation considering distributed storage, so that the cost is reduced for supply chains and the service level of supply chains is enhanced.

Claim (Index 2):
The method according to  claim 1 , wherein, the step of assigning batches to corresponding machines for processing according to an MF batch assignment rule comprises:\n step 1\u2033: obtaining the processing time P b  for each batch b k  and setting a parameter NE after batching jobs according to the BU rule; step 2\u2033: determining upper and lower bounds for batch assignment according to the following laws: for the lower bound: if max \ue8a0 ( P b , b \u2208 B ) \u2265 \u2211 b \u2208 B \ue89e \ue89e P b \uf603 M \uf604 is satisfied, assuming LB=max(P b ,b\u2208B); or otherwise, assuming LB = \u2211 b \u2208 B \ue89e \ue89e P b \uf603 M \uf604 ; for the upper bound: if max \ue8a0 ( P b , b \u2208 B ) \u2265 2 \ue89e \u2211 b \u2208 B \ue89e \ue89e P b \uf603 M \uf604 is satisfied, assuming UB=max(P b ,b\u2208B); or otherwise, assuming UB = 2 \ue89e \u2211 b \u2208 B \ue89e \ue89e P b \uf603 M \uf604 , where |M| is the total number of machines and max(P b ,b\u2208B) represents the maximum batch processing time in all batches;\n step 3\u2033: assuming \n C max = LB + UB 2 ; step 4\u2033: selecting one batch for assignment to a machine every time and ensuring the sum of processing time for this machine not exceeding C max ; if the batch cannot be put on the machine under the limitation of not exceeding C max , resetting LB=C max ; or otherwise, resetting UB=C max ; step 5\u2033: determining whether UB - LB LB \u2264 NE is satisfied; if so, ending the circulation; if not, returning to the step 3\u2033.

Metadata:
- Claim Count in Document: 17.0
- Percentile: 94.0
- Lexical Diversity: 1.60638
- Patent Class: 705.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['15958932', '14434755', '13262458', '15953881', '15323407']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.1044142703555807
- 35 USC 102 Novelty (BERT): 0.5162791870041418
- Combined Prediction Score: 0.1456007620204368
- Mean Citation Score: 188.733076
- Max Citation Score: 216.76024
- Similarity Product: 119.75574525470734

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