BRANCH-AND-BOUND ALGORITHM FOR 2-STAGE PRODUCTION-SEQUENCING PROBLEMS

被引：28

作者：

USKUP, E

SMITH, SB

机构：

[1] CLOW CORP,OAK BROOK,IL 60521

[2] ILLINOIS INST TECHNOL,CHICAGO,IL

来源：

OPERATIONS RESEARCH | 1975年 / 23卷 / 01期

关键词：

D O I：

10.1287/opre.23.1.118

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：118 / 136

页数：19

共 9 条

[1] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[2]

Conway R, 1967, THEORY SCHEDULING

[3] THE TRAVELING-SALESMAN PROBLEM [J].

FLOOD, MM .

OPERATIONS RESEARCH, 1956, 4 (01) :61-75

[4]

HATFIELD DJ, 1966, PRODUCTION SCHEDULIN

[5] BRANCH-AND-BOUND METHODS - A SURVEY [J].

LAWLER, EL ;

WOOD, DE .

OPERATIONS RESEARCH, 1966, 14 (04) :699-+

[6] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

OPERATIONS RESEARCH, 1963, 11 (06) :972-989

[7]

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

[8]

USKUP E, 1973, AIIE T, V5, P142

[9]

USKUP E, 1970, THESIS ILLINOIS I TE

← 1 →