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

被引：94

作者：

HARIRI, AMA

POTTS, CN

机构：

来源：

DISCRETE APPLIED MATHEMATICS | 1983年 / 5卷 / 01期

关键词：

D O I：

10.1016/0166-218X(83)90019-7

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：99 / 109

页数：11

共 9 条

[1] N-1-FBAR DYNAMIC DETERMINISTIC PROBLEMS [J].

CHANDRA, R .

NAVAL RESEARCH LOGISTICS, 1979, 26 (03) :537-544

[2]

Conway R, 1967, THEORY SCHEDULING

[3] SEQUENCING JOBS WITH UNEQUAL READY TIMES TO MINIMIZE MEAN FLOW TIME [J].

DESSOUKY, MI ;

DEOGUN, JS .

SIAM JOURNAL ON COMPUTING, 1981, 10 (01) :192-202

[4]

LABETOULLE J, 1979, BW99 MATH CENTR REP

[5]

Lageweg B.J., 1976, STAT NEERL, V30, P25

[6]

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]

[7]

RINALDI G, 1977, R7724 U ROM I AUT RE

[8]

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

[9]

VANWASSENHOVE L, 1979, THESIS U LEUVEN

← 1 →