SOME APPLICATIONS OF BRANCH-AND-BOUND ALGORITHM TO MACHINE SCHEDULING PROBLEM

被引：62

作者：

BROWN, APG

LOMNICKI, ZA

机构：

来源：

OPERATIONAL RESEARCH QUARTERLY | 1966年 / 17卷 / 02期

关键词：

D O I：

10.2307/3007282

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：173 / &

相关论文

共 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] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS
IGNALL, E
SCHRAGE, L
[J]. OPERATIONS RESEARCH, 1965, 13 (03) : 400 - &
[4] A COUNTEREXAMPLE TO A PROPOSED ALGORITHM FOR OPTIMAL SEQUENCING OF JOBS
KARUSH, W
[J]. OPERATIONS RESEARCH, 1965, 13 (02) : 323 - &
[5] A BRANCH-AND-BOUND ALGORITHM FOR THE EXACT SOLUTION OF THE 3-MACHINE SCHEDULING PROBLEM
LOMNICKI, ZA
[J]. OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (01) : 89 - 100
[6] MEYER HA, 1954 S MONT CARL ED
[7] 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