A weighted modified due date rule for sequencing to minimize weighted tardiness

被引:56
作者
Kanet, JJ
Li, XM
机构
[1] Univ Dayton, Dept MIS Operat Management & Decis Sci, Dayton, OH 45469 USA
[2] Tennessee State Univ, Dept Business Adm, Nashville, TN 37203 USA
关键词
weighted tardiness; priority rules; single machine; scheduling;
D O I
10.1023/B:JOSH.0000031421.64487.95
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Priority dispatching for minimizing job tardiness has been the subject of research investigation for several decades. Minimizing weighted tardiness however has considerably more practical relevance, but for this objective only a few dispatching rules have been advanced and scientifically compared. We introduce here a new rule, which we call "Weighted Modified Due Date" (WMDD) and test its effectiveness against other competing rules that have been developed for weighted tardiness. The test is accomplished via a simulation study of a simple queueing system and by static problem analysis. The WMDD rule is found to compare favorably to all the rules tested.
引用
收藏
页码:261 / 276
页数:16
相关论文
共 30 条
[1]   A SURVEY OF ALGORITHMS FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM [J].
ABDULRAZAQ, TS ;
POTTS, CN ;
VANWASSENHOVE, LN .
DISCRETE APPLIED MATHEMATICS, 1990, 26 (2-3) :235-253
[2]   BPSS - A SCHEDULING SUPPORT SYSTEM FOR THE PACKAGING INDUSTRY [J].
ADLER, L ;
FRAIMAN, N ;
KOBACKER, E ;
PINEDO, M ;
PLOTNICOFF, JC ;
WU, TP .
OPERATIONS RESEARCH, 1993, 41 (04) :641-648
[3]  
Akturk MS, 1998, COMPUT OPER RES, V25, P265, DOI 10.1016/S0305-0548(97)00073-7
[4]  
[Anonymous], THESIS MIT CAMBRIDGE
[5]  
[Anonymous], HDB IND ENG
[6]   WEIGHTED-TARDINESS SCHEDULING ON PARALLEL MACHINES WITH PROPORTIONAL WEIGHTS [J].
ARKIN, EM ;
ROUNDY, RO .
OPERATIONS RESEARCH, 1991, 39 (01) :64-81
[7]  
BAKER KR, 1984, INT J PROD RES, V22, P917, DOI 10.1080/00207548408942511
[8]   SEQUENCING RULES AND DUE-DATE ASSIGNMENTS IN A JOB SHOP [J].
BAKER, KR .
MANAGEMENT SCIENCE, 1984, 30 (09) :1093-1104
[9]  
BAKER KR, 1982, J OPER MANAG, V3, P37, DOI DOI 10.1016/0272-6963(82)90020-1
[10]   SOME NEW EFFICIENT METHODS TO SOLVE THE N/1/RI/SIGMA-TI SCHEDULING PROBLEM [J].
CHU, C ;
PORTMANN, MC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (03) :404-413