AN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH DEADLINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME

被引：44

作者：

POTTS, CN ^{[1
]}

VANWASSENHOVE, LN ^{[1
]}

机构：

[1] CATHOLIC UNIV LEUVEN,AFDELING IND BELEID,B-3030 HEVERLE,BELGIUM

来源：

关键词：

D O I：

10.1016/0377-2217(83)90159-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：379 / 387

页数：9

共 13 条

[1] SINGLE-MACHINE SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERION - A BRANCH AND BOUND APPROACH
BANSAL, SP
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (03) : 177 - 181
[2] SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERIA
BURNS, RN
[J]. NAVAL RESEARCH LOGISTICS, 1976, 23 (01) : 125 - 129
[3] NOTE ON A SCHEDULING PROBLEM WITH DUAL CRITERIA
EMMONS, H
[J]. NAVAL RESEARCH LOGISTICS, 1975, 22 (03) : 615 - 616
[4] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS
FISHER, ML
[J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18
[5] FISHER ML, 1981, BW145 MATH CENTR REP
[6] Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[7] HARIRI AMA, 1981, BW143 MATH CENTR REP
[8] HECK H, 1972, NAVAL RES LOGIST Q, V18, P403
[9] KAN AHG, 1975, OPER RES, V23, P908
[10] 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]