Error bound for common due date assignment and job scheduling on parallel machines

被引：7

作者：

Diamond, JE ^{[1
]}

Cheng, TCE ^{[1
]}

机构：

[1] Hong Kong Polytech, Off Vice President, Kowloon, Peoples R China

来源：

IIE TRANSACTIONS | 2000年 / 32卷 / 05期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1023/A:1007644826949

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n --> infinity.

引用

页码：445 / 448

页数：4

共 11 条

[1] MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

BAGCHI, U ;

SULLIVAN, RS ;

CHANG, YL .

NAVAL RESEARCH LOGISTICS, 1986, 33 (02) :227-240

[2]

CHENG TCE, 1989, J OPER RES SOC, V40, P1129, DOI 10.1057/palgrave.jors.0401208

[3]

CHENG TCE, 1992, ASIA PAC J OPER RES, V9, P235

[4]

Conway R.W., 1967, Theory of Scheduling

[5]

DE P, 1991, J OPER RES SOC, V42, P419, DOI 10.1038/sj/jors/0420509

[6]

EMMONS H, 1987, NAV RES LOG, V34, P803, DOI 10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO

[7]

2-2

[8] SINGLE-PROCESSOR AND MULTIPLE-PROCESSOR MODELS FOR MINIMIZING COMPLETION-TIME VARIANCE [J].

HALL, NG .

NAVAL RESEARCH LOGISTICS, 1986, 33 (01) :49-54

[9] MINIMIZING THE AVERAGE DEVIATION OF JOB COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

KANET, JJ .

NAVAL RESEARCH LOGISTICS, 1981, 28 (04) :643-651

[10] COMMON DUE DATE ASSIGNMENT TO MINIMIZE TOTAL PENALTY FOR THE ONE MACHINE SCHEDULING PROBLEM [J].

PANWALKAR, SS ;

SMITH, ML ;

SEIDMANN, A .

OPERATIONS RESEARCH, 1982, 30 (02) :391-399

← 1 2 →