SCHEDULING PROBLEM INVOLVING SEQUENCE DEPENDENT CHANGEOVER TIMES

被引：27

作者：

LOCKETT, AG

MUHLEMANN, AP

机构：

来源：

OPERATIONS RESEARCH | 1972年 / 20卷 / 04期

关键词：

D O I：

10.1287/opre.20.4.895

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：895 / +

页数：1

共 12 条

[1]

ASHOUR S, 1969, INT J PROD RES, V7, P249

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

BELLMORE, M ;

NEHAUSE.GL .

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

[3] A HEURISTIC METHOD FOR A JOB-SCHEDULING PROBLEM [J].

BURSTALL, RM .

OPERATIONAL RESEARCH QUARTERLY, 1966, 17 (03) :291-&

[4]

CAMBELL HG, 1970, MANAGE SCI, V16, pB630

[5]

Conway R. W., 1967, THEORY SCHEDULING

[6]

HELD M, 1970, 7 MATH PROGR S

[7] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS [J].

IGNALL, E ;

SCHRAGE, L .

OPERATIONS RESEARCH, 1965, 13 (03) :400-&

[8]

Johnson S. M., 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

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

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

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

[10]

USKUP E, 1970, THESIS ILLINOIS I TE

← 1 2 →