MINIMIZING WEIGHTED COMPLETION TIMES WITH DEADLINES

被引:51
作者
POSNER, ME
机构
关键词
D O I
10.1287/opre.33.3.562
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:562 / 574
页数:13
相关论文
共 14 条
[2]   SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERIA [J].
BURNS, RN .
NAVAL RESEARCH LOGISTICS, 1976, 23 (01) :125-129
[3]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[4]   NOTE ON A SCHEDULING PROBLEM WITH DUAL CRITERIA [J].
EMMONS, H .
NAVAL RESEARCH LOGISTICS, 1975, 22 (03) :615-616
[5]   A NEW DOMINANCE CONCEPT IN SCHEDULING N-JOBS ON A SINGLE-MACHINE WITH READY TIMES AND DUE DATES [J].
ERSCHLER, J ;
FONTAN, G ;
MERCE, C ;
ROUBELLAT, F .
OPERATIONS RESEARCH, 1983, 31 (01) :114-127
[6]   FINDING SOME ESSENTIAL CHARACTERISTICS OF FEASIBLE SOLUTIONS FOR A SCHEDULING PROBLEM [J].
ERSCHLER, J ;
ROUBELLAT, F ;
VERNHES, JP .
OPERATIONS RESEARCH, 1976, 24 (04) :774-783
[7]   AN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH RELEASE DATES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].
HARIRI, AMA ;
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :99-109
[8]  
KAN AHG, 1975, OPER RES, V23, P908
[9]  
Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[10]  
MIYAZAKI S, 1981, J OPNS RES SOC JPN, V24, P31