Scheduling method and system based on hybrid variable neighborhood search and gravitational search algorithm
US10402404B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 11, 2018 |
| Grant date | Sep 3, 2019 |
| Priority date | — |
| Expiry date | Sep 11, 2038 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02P90/30
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present invention discloses a scheduling method and system based on a hybrid variable neighborhood search and gravitational search algorithm. The method includes: 1 setting parameters of the algorithm; 2 initializing an initial solution of the algorithm; 3 performing local search based on a gravitational search algorithm (GSA); 4 updating the initial solution; 5 determining whether an algorithm termination condition is satisfied; if yes, outputting the global optimal solution searched for by the algorithm, otherwise, returning to the step 3. According to the present invention, a near-optimal solution for the continuous batch processing problem based on position learning effect and linear starting time can be obtained, so that an enterprise can make full use of production resources thereof to the utmost extent, and thus reduce production costs and improve the enterprise service level and the customer satisfaction level.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.