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 5:
6. The method according to claim 5, wherein the step 6d comprises:
step 6d1: finding a feasible resource combination Pdn with the least resources occupied by planned tasks for task omn, and setting Pzn as representing a set of resources occupied by the planned tasks and in Pdn;
step 6d2: traversing each resource arc a∈Pzn; for the task that occupies resource arc a, denoted by fom(a), re-allocating a new resource combination for fom(a) through resource interchange, so that the resource arc a is no longer occupied; and if the resource interchange succeeds, updating GK′(V, A′), and deleting resource a from Pzn; otherwise, skipping to the step 6e; and
step 6d3: finding a path pn from obn┌tsn/τ┐ and dc└ten/τ┘ in GK′(V′, A′) as the new resource combination allocated to task omn, updating GK′(V′, A′), and adding task omn to the set OMy.