SCHEDULING N JOBS ON ONE MACHINE TO MINIMIZE THE MAXIMUM TARDINESS WITH MINIMUM NUMBER TARDY

被引：41

作者：

SHANTHIKUMAR, JG

机构：

来源：

COMPUTERS & OPERATIONS RESEARCH | 1983年 / 10卷 / 03期

关键词：

D O I：

10.1016/0305-0548(83)90018-7

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：255 / 266

页数：12

共 15 条

[1] SEQUENCING WITH DUE-DATES AND EARLY START TIMES TO MINIMIZE MAXIMUM TARDINESS [J].

BAKER, KR ;

SU, ZS .

NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :171-176

[2] SCHEDULING WITH EARLIEST START AND DUE DATE CONSTRAINT [J].

BRATLEY, P ;

ROBILLAR.P ;

FLORIAN, M .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04) :511-&

[3] SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERIA [J].

BURNS, RN .

NAVAL RESEARCH LOGISTICS, 1976, 23 (01) :125-129

[4]

Conway R, 1967, THEORY SCHEDULING

[5] ONE MACHINE SEQUENCING TO MINIMIZE MEAN FLOW TIME WITH MINIMUM NUMBER TARDY [J].

EMMONS, H .

NAVAL RESEARCH LOGISTICS, 1975, 22 (03) :585-592

[6] NOTE ON A SCHEDULING PROBLEM WITH DUAL CRITERIA [J].

EMMONS, H .

NAVAL RESEARCH LOGISTICS, 1975, 22 (03) :615-616

[7] EXTENSION OF A RESULT ON SCHEDULING WITH SECONDARY CRITERIA [J].

HECK, H ;

ROBERTS, S .

NAVAL RESEARCH LOGISTICS, 1972, 19 (02) :403-405

[8] A MULTIPLE OBJECTIVE DECISION THEORETIC APPROACH TO ONE-MACHINE SCHEDULING PROBLEMS [J].

KAO, EPC .

COMPUTERS & OPERATIONS RESEARCH, 1980, 7 (04) :251-259

[9] SCHEDULING WITH READY TIMES AND DUE DATES TO MINIMIZE MAXIMUM LATENESS [J].

MCMAHON, G ;

FLORIAN, M .

OPERATIONS RESEARCH, 1975, 23 (03) :475-482

[10]

MONMA CL, 1980, OPS RES, V28, P924

← 1 2 →