Abstract:
Consideration was given to scheduling by the criterion for uniform use of resources. It was assumed that each job is executed by a unit resource. Two types of inter-job dependences were studied: “finish-finish” (one job cannot be completed until the other is completed) and “finish-start” (one job cannot be started until the other is not completed). To solve the problem, a geometrical method reducing solution to determining the shortest trajectory in a domain constructed from the network graph was proposed.
Presented by the member of Editorial Board:V. V. Kul'ba