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 4:
5. The method according to claim 1, wherein the step 6 comprises:
step 6a: obtaining the resource time-varying graph GK(V, A) and a subgraph GK′(V′, A′) that has removed resource arcs represented by resources occupied by planned tasks, and obtaining a set of tasks OMy that is successfully planned and a set of tasks OMw that has not been planned;
step 6b: calculating resource shortage degrees of all tasks in OMw, and sorting the resource shortage degrees from high to low;
step 6c: initializing a counter n=1;
step 6d: finding an idle resource combination for the n-th task omn in OMw through the resource interchange;
step 6e: increasing the counter n by 1; and
step 6f: proceeding to the step 6d when n is smaller than or equal to |OMw|; otherwise, outputting the set of tasks OMy.