AN EFFICIENT ALGORITHM FOR THE JOB-SHOP PROBLEM WITH 2 JOBS

被引：58
作者：
BRUCKER, P
机构：
来源：
COMPUTING | 1988年 / 40卷 / 04期
关键词：
D O I：
10.1007/BF02276919
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：353 / 359
页数：7
相关论文
共 8 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]   A GRAPHICAL APPROACH TO PRODUCTION SCHEDULING PROBLEMS [J].
AKERS, SB .
OPERATIONS RESEARCH, 1956, 4 (02) :244-245
[3]  
CARLIER J, 1987, BRANCH BOUND METHOD
[4]   A GEOMETRIC MODEL AND A GRAPHICAL ALGORITHM FOR A SEQUENCING PROBLEM [J].
HARDGRAVE, WW ;
NEMHAUSER, GL .
OPERATIONS RESEARCH, 1963, 11 (06) :889-900
[5]   AN EFFICIENT OPTIMAL ALGORITHM FOR THE 2-MACHINES UNIT-TIME JOBSHOP SCHEDULE-LENGTH PROBLEM [J].
HEFETZ, N ;
ADIRI, I .
MATHEMATICS OF OPERATIONS RESEARCH, 1982, 7 (03) :354-360
[6]  
Jackson J.R., 1956, NAV RES LOGIST Q, V3, P201, DOI [10.1002/nav.3800030307, DOI 10.1002/NAV.3800030307]
[7]  
Muth J., 1963, IND SCHEDULING
[8]   SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM [J].
SZWARC, W .
OPERATIONS RESEARCH, 1960, 8 (06) :782-788
1