Computer network scheduling
This paper presents a method for solving the scheduling problem of a computer-network. There are three possible criteria for optimality: (1) Maximum number of jobs to be processed per given period. (2) Minimum idle time for each of the computers in the network, or in other words, maximum utilization. (3) Optimizing an objective function which combines 1 and 2 and which may consider additional factors.
Year of publication: |
1975
|
---|---|
Authors: | Ben-Bassat, Moshe ; Borovits, Israel |
Published in: |
Omega. - Elsevier, ISSN 0305-0483. - Vol. 3.1975, 1, p. 119-123
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Managing of computer operations
Borovits, Israel, (1984)
-
Determination of optimal delivery size of containers
Borovits, Israel, (1976)
-
Evaluating the performance capability of a multi-organization system
Spiegler, Israel, (1983)
- More ...