ORDER PICKING IN AN AISLE

被引:87
作者
GOETSCHALCKX, M
RATLIFF, HD
机构
[1] GEORGIA INST TECHNOL,PROD RES CTR,ATLANTA,GA 30332
[2] GEORGIA INST TECHNOL,LOGIST SYST MAT HANDLING RES CTR,ATLANTA,GA 30332
关键词
D O I
10.1080/07408178808966150
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
引用
收藏
页码:53 / 62
页数:10
相关论文
共 9 条
[1]  
BARACHET LL, 1957, OPERATIONS RES, V5, P971
[2]  
Christofides N., 1975, GRAPH THEORY ALGORIT
[3]   EFFICIENT SPECIAL CASE ALGORITHMS FOR THE N-LINE PLANAR TRAVELING SALESMAN PROBLEM [J].
CUTLER, M .
NETWORKS, 1980, 10 (03) :183-195
[4]  
GAREY MR, 1976, 8TH P ANN ACM S THEO, P10
[5]   SEQUENCING 1 STATE-VARIABLE MACHINE - SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1964, 12 (05) :655-&
[6]  
Karp R. M., 1972, COMPLEXITY COMPUTER, P85
[7]  
LAWLER EL, 1971, MATH PROGRAM, V1, P267
[8]   ORDER-PICKING IN A RECTANGULAR WAREHOUSE - A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM [J].
RATLIFF, HD ;
ROSENTHAL, AS .
OPERATIONS RESEARCH, 1983, 31 (03) :507-521
[9]   AN EFFICIENT ALGORITHM FOR SORTING WITH MINIMAL STORAGE [J].
SINGLETON, RC .
COMMUNICATIONS OF THE ACM, 1969, 12 (03) :185-+