SCHEDULING FOR MINIMUM TOTAL LOSS USING SERVICE TIME DISTRIBUTIONS

被引:30
作者
SEVCIK, KC [1 ]
机构
[1] UNIV CHICAGO,CHICAGO,IL 60680
关键词
D O I
10.1145/321796.321803
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:66 / 75
页数:10
相关论文
共 10 条
[1]  
Chazan D, 1968, J COMB THEORY, V5, P344
[2]  
GREENBERGER M, 1966, MANAGE SCI, V12, P888
[3]   A NOTE ON TIME SHARING WITH PREFERRED CUSTOMERS [J].
KONHEIM, AG .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1968, 9 (02) :112-&
[4]  
KONHEIM AG, 1967, RC1804 IBM CORP REP
[5]   SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].
MCNAUGHTON, R .
MANAGEMENT SCIENCE, 1959, 6 (01) :1-12
[6]  
Rothkopf M., 1966, MANAGE SCI, V12, P627, DOI DOI 10.1287/MNSC.12.9.707
[7]   A PROOF OF OPTIMALITY OF SHORTEST REMAINING PROCESSING TIME DISCIPLINE [J].
SCHRAGE, L .
OPERATIONS RESEARCH, 1968, 16 (03) :687-&
[8]  
SCHRAGE LE, 1970, ICR26 U CHIC QUART R
[9]  
SEVCIK KC, 1971, THESIS U CHICAGO
[10]  
Smith W.E., 1956, NAV RES LOGIST Q, V3, P59, DOI DOI 10.1002/NAV.3800030106