SIMULATED ANNEALING FOR PERMUTATION FLOWSHOP SCHEDULING

被引：435
作者：
OSMAN, IH
POTTS, CN
机构：
[1] UNIV SOUTHAMPTON,FAC MATH STUDIES,SOUTHAMPTON SO9 5NH,HANTS,ENGLAND
[2] UNIV LONDON IMPERIAL COLL SCI & TECHNOL,LONDON SW7 2AZ,ENGLAND
来源：
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 1989年 / 17卷 / 06期
关键词：
D O I：
10.1016/0305-0483(89)90059-5
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：551 / 557
页数：7
相关论文
共 15 条
[1]   NEW BOUND FOR MACHINE SCHEDULING [J].
BESTWICK, PF ;
HASTINGS, NAJ .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :479-487
[2]  
CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630
[3]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[4]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[5]   COOLING SCHEDULES FOR OPTIMAL ANNEALING [J].
HAJEK, B .
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) :311-329
[6]  
Johnson S. M., 1954, NAV RES LOGIST Q, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[7]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[8]  
Laarhoven P. J. M., 1987, SIMULATED ANNEALING
[9]  
Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[10]   CONVERGENCE OF AN ANNEALING ALGORITHM [J].
LUNDY, M ;
MEES, A .
MATHEMATICAL PROGRAMMING, 1986, 34 (01) :111-124
12