Computer network scheduling

Moshe Ben-Bassat; Israel Borovits

doi:10.1016/0305-0483(75)90055-9

Computer network scheduling

Moshe Ben-Bassat, Israel Borovits

Coller School of Management

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	119-123
Number of pages	5
Journal	Omega
Volume	3
Issue number	1
DOIs	https://doi.org/10.1016/0305-0483(75)90055-9
State	Published - Feb 1975

Access to Document

10.1016/0305-0483(75)90055-9

Cite this

@article{3353be8b2ec64f208f941c0d3a20bceb,

title = "Computer network scheduling",

abstract = "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.",

author = "Moshe Ben-Bassat and Israel Borovits",

year = "1975",

month = feb,

doi = "10.1016/0305-0483(75)90055-9",

language = "אנגלית",

volume = "3",

pages = "119--123",

journal = "Omega",

issn = "0305-0483",

publisher = "Elsevier BV",

number = "1",

}

TY - JOUR

T1 - Computer network scheduling

AU - Ben-Bassat, Moshe

AU - Borovits, Israel

PY - 1975/2

Y1 - 1975/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49549143478&partnerID=8YFLogxK

U2 - 10.1016/0305-0483(75)90055-9

DO - 10.1016/0305-0483(75)90055-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:49549143478

SN - 0305-0483

VL - 3

SP - 119

EP - 123

JO - Omega

JF - Omega

IS - 1

ER -

Computer network scheduling

Abstract

Access to Document

Other files and links

Fingerprint

Cite this