ON THE MINIMIZATION OF THE WEIGHTED NUMBER OF TARDY JOBS WITH RANDOM PROCESSING TIMES AND DEADLINE

被引：23

作者：

DE, P ^{[1
]}

GHOSH, JB ^{[1
]}

WELLS, CE ^{[1
]}

机构：

[1] UNIV DAYTON,DEPT MIS & DECIS SCI,DAYTON,OH 45469

来源：

COMPUTERS & OPERATIONS RESEARCH | 1991年 / 18卷 / 05期

关键词：

D O I：

10.1016/0305-0548(91)90022-J

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider a stochastic scheduling problem where a set of jobs with random processing times are sequenced on a single machine in order to minimize the total weighted number of jobs which finish after an exponentially distributed common deadline. A simple sequencing rule is identified which minimizes the expected weighted number of tardy jobs. Sufficient conditions are determined for the existence of a sequence which stochastically minimizes the total weighted number of tardy jobs, and a sequencing rule is derived which stochastically minimizes the total number of tardy jobs. The equivalence of static and dynamic sequencing policies is shown for a large class of processing time distributions.

引用

页码：457 / 463

页数：7

共 10 条

[1]

Balut S. J., 1973, Management Science, V19, P1283, DOI 10.1287/mnsc.19.11.1283

[2]

BARLOW RE, 1975, STATISTICAL THEORY R

[3] N-JOB, ONE MACHINE SEQUENCING PROBLEMS UNDER UNCERTAINTY [J].