APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS

被引：352

作者：

IGNALL, E

SCHRAGE, L

机构：

来源：

OPERATIONS RESEARCH | 1965年 / 13卷 / 03期

关键词：

D O I：

10.1287/opre.13.3.400

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：400 / &

共 10 条

[1]

BESSEL D, 1964, LPF LIST PROCESSING

[2]

BROOKS GH, 1965, J IND ENGINEERING, V16, P34

[3]

CONWAY RW, TO APPEAR

[4] DEVELOPMENT OF M-STAGE DECISION RULE FOR SCHEDULING N JOBS THROUGH M MACHINES [J].

DUDEK, RA ;

TEUTON, OF .

OPERATIONS RESEARCH, 1964, 12 (03) :471-&

[5] APPROXIMATE SOLUTIONS TO 3-MACHINE SCHEDULING PROBLEM [J].

GIGLIO, RJ ;

WAGNER, HM .

OPERATIONS RESEARCH, 1964, 12 (02) :305-&

[6]

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

[7]

JOHNSON SM, 1963, INDUSTRIAL SCHEDULIN, pCH2

[8] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J].

LAND, AH ;

DOIG, AG .

ECONOMETRICA, 1960, 28 (03) :497-520

[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]

MUTH JF, 1963, INDUSTRIAL SCHEDULIN, pCH2

← 1 →