Minimizing the expected number of tardy jobs when processing times are normally distributed

被引：21

作者：

Jang, WS ^{[1
]}

Klein, CM ^{[1
]}

机构：

[1] Univ Missouri, Dept Ind & Mfg Syst Engn, Columbia, MO 65211 USA

来源：

OPERATIONS RESEARCH LETTERS | 2002年 / 30卷 / 02期

关键词：

stochastic scheduling; single machine; tardy jobs; heuristic;

D O I：

10.1016/S0167-6377(02)00110-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper studies the single machine scheduling problem for the purpose of minimizing the expected number of tardy jobs, The effect of variance of processing time is evaluated. and a dynamic policy based on a myopic approach is developed. The conditions for the optimality and the worst case analysis are provided. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：100 / 106

页数：7

共 14 条

[1]

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

[2] Bounds on optimal values in stochastic scheduling [J].

Birge, JR ;

Glazebrook, KD .

OPERATIONS RESEARCH LETTERS, 1997, 21 (03) :107-114

[3] MINIMIZING THE EXPECTED WEIGHTED NUMBER OF TARDY JOBS IN STOCHASTIC FLOW SHOPS [J].

BOXMA, OJ ;

FORST, FG .

OPERATIONS RESEARCH LETTERS, 1986, 5 (03) :119-126

[4]

Cai X, 1997, NAV RES LOG, V44, P531, DOI 10.1002/(SICI)1520-6750(199709)44:6<531::AID-NAV2>3.0.CO

[5]

2-4

[6] REARRANGEMENT, MAJORIZATION AND STOCHASTIC SCHEDULING [J].

CHANG, CS ;

YAO, DD .

MATHEMATICS OF OPERATIONS RESEARCH, 1993, 18 (03) :658-684

[7] ON THE MINIMIZATION OF THE WEIGHTED NUMBER OF TARDY JOBS WITH RANDOM PROCESSING TIMES AND DEADLINE [J].

DE, P ;

GHOSH, JB ;

WELLS, CE .

COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (05) :457-463

[8]

Du J, 1990, MATH OPER RES, V3, P483

[9]

KARP R. M., 1972, COMPLEXITY COMPUTER, P85, DOI DOI 10.1007/978-1-4684-2001-2_9

[10] ON BALUT ALGORITHM AND NP-COMPLETENESS FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM [J].

KISE, H ;

IBARAKI, T .

MANAGEMENT SCIENCE, 1983, 29 (03) :384-388

← 1 2 →