TY - JOUR
T1 - A note on time-sharing
AU - Chazan, Dan
AU - Konheim, Alan G.
AU - Weiss, Benjamin
PY - 1968/12
Y1 - 1968/12
N2 - The setting for the problem discussed here is a service facility which is to be "time-shared" by two customers. A precise notion of a processing schedule, which prescribes the times at which the facility is available to each customer, is introduced. Associated with each schedule is the expected total waiting time of the two customers. The schedules which minimize this time are called optimum schedules and are determined here. A number of examples and extensions are given which indicate, the scope of the methods used.
AB - The setting for the problem discussed here is a service facility which is to be "time-shared" by two customers. A precise notion of a processing schedule, which prescribes the times at which the facility is available to each customer, is introduced. Associated with each schedule is the expected total waiting time of the two customers. The schedules which minimize this time are called optimum schedules and are determined here. A number of examples and extensions are given which indicate, the scope of the methods used.
UR - http://www.scopus.com/inward/record.url?scp=33750741704&partnerID=8YFLogxK
U2 - 10.1016/S0021-9800(68)80011-0
DO - 10.1016/S0021-9800(68)80011-0
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33750741704
SN - 0021-9800
VL - 5
SP - 344
EP - 369
JO - Journal of Combinatorial Theory
JF - Journal of Combinatorial Theory
IS - 4
ER -