A BI-CRITERION APPROACH TO MINIMIZING INVENTORY COSTS ON A SINGLE-MACHINE WHEN EARLY SHIPMENTS ARE FORBIDDEN

被引：11

作者：

FRY, TD

LEONG, GK

机构：

来源：

COMPUTERS & OPERATIONS RESEARCH | 1987年 / 14卷 / 05期

关键词：

D O I：

10.1016/0305-0548(87)90033-5

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：363 / 368

页数：6

共 10 条

[1] SCHEDULING TO MINIMIZE MAXIMUM CUMULATIVE COST SUBJECT TO SERIES-PARALLEL PRECEDENCE CONSTRAINTS [J].

ABDELWAHAB, HM ;

KAMEDA, T .

OPERATIONS RESEARCH, 1978, 26 (01) :141-158

[2]

BAGCHI U, UNPUB MGMT SCI

[3]

BAGCHI U, UNPUB NAV RES LOGIST

[4]

Baker K., 1974, INTRO SEQUENCING SCH

[5]

KANET JK, 1981, NAV RES LOGIST Q, V27, P643

[6] OPTIMAL SINGLE-MACHINE SCHEDULING WITH EARLINESS AND TARDINESS PENALTIES [J].

LAKSHMINARAYAN, S ;

LAKSHMANAN, R ;

PAPINEAU, RL ;

ROCHETTE, R .

OPERATIONS RESEARCH, 1978, 26 (06) :1079-1082

[7] SEQUENCING TO MINIMIZE THE MAXIMUM JOB COST [J].

MONMA, CL .

OPERATIONS RESEARCH, 1980, 28 (04) :942-951

[8] 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

[9] OPTIMAL SINGLE-MACHINE SCHEDULING WITH EARLINESS AND TARDINESS PENALTIES [J].

SIDNEY, JB .

OPERATIONS RESEARCH, 1977, 25 (01) :62-69

[10] MINIMIZING THE SUM OF ABSOLUTE LATENESS IN SINGLE-MACHINE AND MULTIMACHINE SCHEDULING [J].

SUNDARARAGHAVAN, PS ;

AHMED, MU .

NAVAL RESEARCH LOGISTICS, 1984, 31 (02) :325-333

← 1 →