Computer network scheduling

Moshe Ben-Bassat, Israel Borovits

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)119-123
Number of pages5
Issue number1
StatePublished - Feb 1975


Dive into the research topics of 'Computer network scheduling'. Together they form a unique fingerprint.

Cite this