A BRANCH-AND-BOUND ALGORITHM FOR THE EXACT SOLUTION OF THE 3-MACHINE SCHEDULING PROBLEM

被引：124

作者：

LOMNICKI, ZA

机构：

来源：

OPERATIONAL RESEARCH QUARTERLY | 1965年 / 16卷 / 01期

关键词：

D O I：

10.2307/3006687

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：89 / 100

页数：12

相关论文

共 7 条

[1] DEVELOPMENT OF M-STAGE DECISION RULE FOR SCHEDULING N JOBS THROUGH M MACHINES
DUDEK, RA
TEUTON, OF
[J]. OPERATIONS RESEARCH, 1964, 12 (03) : 471 - &
[2] APPROXIMATE SOLUTIONS TO 3-MACHINE SCHEDULING PROBLEM
GIGLIO, RJ
WAGNER, HM
[J]. OPERATIONS RESEARCH, 1964, 12 (02) : 305 - &
[3] JOHNSON SM, 1954, NAV RES LOGIST Q, V1, P66
[4] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
LITTLE, JDC
MURTY, KG
SWEENEY, DW
KAREL, C
[J]. OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989
[5] PAGE ES, 1961, J ROY STAT SOC B, V23, P484
[6] SEQUENCING JOBS THROUGH A MULTI-STAGE PROCESS IN THE MINIMUM TOTAL TIME - A QUICK METHOD OF OBTAINING A NEAR OPTIMUM
PALMER, DS
[J]. OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (01) : 101 - 107
[7] ROY B, 1962, METRA SERIE SPECIALE, V1