A NOTE ON THE WEIGHTED TARDINESS PROBLEM

被引:35
作者
RACHAMADUGU, RMV
机构
[1] Univ of Michigan, Ann Arbor, MI, USA, Univ of Michigan, Ann Arbor, MI, USA
关键词
JOB ANALYSIS - PRODUCTION CONTROL - Scheduling;
D O I
10.1287/opre.35.3.450
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We identify a condition characterizing adjacent jobs in an optimal sequence for the weighted tardiness problem. This condition can be used as an effective pruning device in enumerative methods. Further, we show that the Modified Due Date Rule is a special case of this condition. We identify a set of circumstances under which the first job in an optimal sequence can be determined without fully solving the problem.
引用
收藏
页码:450 / 452
页数:3
相关论文
共 8 条
[1]  
Baker K., 1974, INTRO SEQUENCING SCH
[2]  
Baker K.R., 1982, J OPER MANAGE, V3, P37
[3]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[4]  
KAN AHG, 1975, OPER RES, V23, P908
[5]   SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].
MCNAUGHTON, R .
MANAGEMENT SCIENCE, 1959, 6 (01) :1-12
[6]  
Morton T.E., 1982, MYOPIC HEURISTICS SI
[7]   TIME-DEPENDENT TRAVELING SALESMAN PROBLEM AND ITS APPLICATION TO TARDINESS PROBLEM IN ONE-MACHINE SCHEDULING [J].
PICARD, JC ;
QUEYRANNE, M .
OPERATIONS RESEARCH, 1978, 26 (01) :86-110
[8]   A BRANCH AND BOUND ALGORITHM FOR THE TOTAL WEIGHTED TARDINESS PROBLEM [J].
POTTS, CN ;
VANWASSENHOVE, LN .
OPERATIONS RESEARCH, 1985, 33 (02) :363-377