MINIMIZING THE TOTAL FLOW TIME OF N JOBS ON A NETWORK

被引：46

作者：

SIMCHILEVI, D ^{[1
]}

BERMAN, O ^{[1
]}

机构：

[1] UNIV TORONTO,DEPT MANAGEMENT,TORONTO M5S 1A1,ONTARIO,CANADA

来源：

IIE TRANSACTIONS | 1991年 / 23卷 / 03期

关键词：

D O I：

10.1080/07408179108963858

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper addresses the problem of determining a sequence for processing jobs on a machine, with sequence dependent setup times, such that the total flow time is minimized. The paper includes a branch and bound algorithm to find the optimal tour sequence.

引用

页码：236 / 244

页数：9

共 10 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2] MINISUM LOCATION OF A TRAVELING SALESMAN [J].

BERMAN, O ;

LEVI, DS .

NETWORKS, 1986, 16 (03) :239-254

[3] DYNAMIC REPOSITIONING OF INDISTINGUISHABLE SERVICE UNITS ON TRANSPORTATION NETWORKS [J].

BERMAN, O .

TRANSPORTATION SCIENCE, 1981, 15 (02) :115-136

[4]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[5] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

OPERATIONS RESEARCH, 1969, 17 (03) :395-&

[6]

HANDLER G. Y., 1979, LOCATION NETWORKS

[7]

JAILLET P, 1985, MIT185 OP RES CTR TE

[8]

MINIEKA E, 1984, 1984 ORSA TIMS SAN F

[9]

Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI

[10] P-COMPLETE APPROXIMATION PROBLEMS [J].

SAHNI, S ;

GONZALEZ, T .

JOURNAL OF THE ACM, 1976, 23 (03) :555-565

← 1 →