Method and system for scheduling parallel processing machines based on hybrid shuffled frog leaping algorithm and variable neighborhood search algorithm
US10401840B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 20, 2018 |
| Grant date | Sep 3, 2019 |
| Priority date | — |
| Expiry date | Apr 20, 2038 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02P90/02
- WIPO fieldControl
- WIPO sectorInstruments
Abstract
A method and a system for scheduling parallel machines based on hybrid shuffled frog leaping algorithm and variable neighborhood search algorithm are provided to solve collaborative production and processing of jobs on a plurality of unrelated batch processing machines. The jobs are distributed to machines based on the normal processing time and deterioration situation of the jobs on different machines and are arranged. An effective multi-machine heuristic rule is designed according to the structural properties of an optimal solution for the single-machine problem, and the improved rule is applied to the improved shuffled frog leaping algorithm to solve this problem. The improvement strategy for the traditional shuffled frog leaping algorithm is to improve the local search procedure of the traditional frog leaping algorithm by introducing the variable neighborhood search algorithm. The convergence rate and optimization capacity of the original algorithm are thus improved.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.