AN IMPROVED LOWER BOUND FOR MINIMIZING WEIGHTED COMPLETION TIMES WITH DEADLINES

被引：10

作者：

BAGCHI, U

AHMADI, RH

机构：

来源：

OPERATIONS RESEARCH | 1987年 / 35卷 / 02期

关键词：

D O I：

10.1287/opre.35.2.311

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：311 / 313

页数：3

共 6 条

[1] SINGLE-MACHINE SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERION - A BRANCH AND BOUND APPROACH [J].

BANSAL, SP .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (03) :177-181

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

EMMONS, H .

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

[3]

Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

[4] MINIMIZING WEIGHTED COMPLETION TIMES WITH DEADLINES [J].

POSNER, ME .

OPERATIONS RESEARCH, 1985, 33 (03) :562-574

[5] AN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH DEADLINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].

POTTS, CN ;

VANWASSENHOVE, LN .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (04) :379-387

[6]

Smith W.E., 1956, NAV RES LOGIST Q, V3, P59, DOI DOI 10.1002/NAV.3800030106

← 1 →