Patent ID: 11884423
Assignee: XI'AN UNIVERSITY OF ARCHITECTURE AND TECHNOLOGY
Field: Transport (Mechanical engineering)
Classification: CPC B  G  H | IPC B  G  H

Claim 3:
4. The method according to claim 1, wherein the step 5 comprises:
step 5a: initializing an output set Psu=∅;
step 5b: sorting all vertices in PC based on respective degrees in a descending order, and selecting a vertex p0 with the largest degree;
step 5c: adding the vertex p0 with the largest degree to the output set Psu;
step 5d: deleting vertex p0 and all the vertices adjacent to p0 from PC, and deleting all the edges associated with the deleted vertices from EC; and
step 5e: proceeding to the step 5b if PC≠∅; otherwise, outputting the set Psu, and obtaining, based on Psu, a set of planned tasks and a resource allocation scheme of the planned tasks.