Telecommunication network technician scheduling via multi-agent randomized greedy search
US10949782B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 6, 2018 |
| Grant date | Mar 16, 2021 |
| Priority date | — |
| Expiry date | Apr 25, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/06395
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
A processing system may obtain a loan graph including a travel cost for network technicians between adjacent work centers of a telecommunication network, each network technician assigned to a work center, and obtain work quantities for each work center for a day, at least a first work center having excess work for network technicians assigned to the first work center. The processing system may select, in accordance with an objective function, moves by a first subset of network technicians comprising moves to adjacent work centers from the work centers to which the first subset is assigned, select in accordance with the objective function, moves by a second subset of network technicians comprising moves to adjacent work centers from work centers to which the second subset is assigned, and generate a work plan for the day for the network technicians in accordance with the moves.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.