DYNAMIC-PROGRAMMING STATE-SPACE RELAXATION FOR SINGLE-MACHINE SCHEDULING

被引：104

作者：

ABDULRAZAQ, TS

POTTS, CN

机构：

[1] Univ of Keele, UK, Univ of Keele, UK

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1988年 / 39卷 / 02期

关键词：

D O I：

10.1057/jors.1988.26

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

8

引用

收藏

页码：141 / 152

页数：12

相关论文

共 8 条

[1] STATE-SPACE RELAXATION PROCEDURES FOR THE COMPUTATION OF BOUNDS TO ROUTING-PROBLEMS
CHRISTOFIDES, N
MINGOZZI, A
TOTH, P
[J]. NETWORKS, 1981, 11 (02) : 145 - 164
[2] DUAL ALGORITHM FOR ONE-MACHINE SCHEDULING PROBLEM
FISHER, ML
[J]. MATHEMATICAL PROGRAMMING, 1976, 11 (03) : 229 - 251
[3] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS
HELD, M
KARP, RM
[J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01): : 196 - 210
[4] Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223
[5] LAWLER EL, 1979, BW106 MATH CENTR REP
[6] A BRANCH AND BOUND ALGORITHM FOR THE TOTAL WEIGHTED TARDINESS PROBLEM
POTTS, CN
VANWASSENHOVE, LN
[J]. OPERATIONS RESEARCH, 1985, 33 (02) : 363 - 377
[7] MINIMIZING TOTAL COSTS IN ONE-MACHINE SCHEDULING
RINNOOYKAN, AHG
LAGEWEG, BJ
LENSTRA, JK
[J]. OPERATIONS RESEARCH, 1975, 23 (05) : 908 - 927
[8] DYNAMIC-PROGRAMMING SOLUTION OF SEQUENCING PROBLEMS WITH PRECEDENCE CONSTRAINTS
SCHRAGE, L
BAKER, KR
[J]. OPERATIONS RESEARCH, 1978, 26 (03) : 444 - 449