GENERAL BOUNDING SCHEME FOR PERMUTATION FLOW-SHOP PROBLEM

被引:127
作者
LAGEWEG, BJ [1 ]
LENSTRA, JK [1 ]
RINNOOYKAN, AHG [1 ]
机构
[1] ERASMUS UNIV,ROTTERDAM,NETHERLANDS
关键词
D O I
10.1287/opre.26.1.53
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:53 / 67
页数:15
相关论文
共 25 条
[1]  
Ashour S., 1970, AIIE T, V2, P172
[2]   COMPARATIVE STUDY OF FLOW-SHOP ALGORITHMS [J].
BAKER, KR .
OPERATIONS RESEARCH, 1975, 23 (01) :62-73
[3]   NEW BOUND FOR MACHINE SCHEDULING [J].
BESTWICK, PF ;
HASTINGS, NAJ .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :479-487
[4]  
Bricker P., 1977, ANN DISCRETE MATH, V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[5]   SOME APPLICATIONS OF BRANCH-AND-BOUND ALGORITHM TO MACHINE SCHEDULING PROBLEM [J].
BROWN, APG ;
LOMNICKI, ZA .
OPERATIONAL RESEARCH QUARTERLY, 1966, 17 (02) :173-&
[6]  
CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630
[7]  
Conway R, 1967, THEORY SCHEDULING
[8]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[9]   APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS [J].
IGNALL, E ;
SCHRAGE, L .
OPERATIONS RESEARCH, 1965, 13 (03) :400-&
[10]  
Jackson J. R., 1955, 43 U CAL MAN SCI RES