UNIT EXECUTION TIME SHOP PROBLEMS

被引:42
作者
GONZALEZ, T [1 ]
机构
[1] PENN STATE UNIV, UNIVERSITY PK, PA 16802 USA
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
10.1287/moor.7.1.57
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:57 / 66
页数:10
相关论文
共 19 条
[1]   On colouring the nodes of a network [J].
Brooks, RL .
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197
[2]  
Coffman E.G., 1976, COMPUTER JOB SHOP SC
[3]  
Conway R, 1967, THEORY SCHEDULING
[4]  
Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1
[5]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[6]   STRONG NP-COMPLETENESS RESULTS - MOTIVATION, EXAMPLES, AND IMPLICATIONS [J].
GAREY, MR ;
JOHNSON, DS .
JOURNAL OF THE ACM, 1978, 25 (03) :499-508
[7]   SEQUENCING 1 STATE-VARIABLE MACHINE - SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1964, 12 (05) :655-&
[8]  
GONZALEZ T, 1979, IEEE T COMPUT, V28, P782, DOI 10.1109/TC.1979.1675246
[9]  
GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985
[10]  
GONZALEZ T, 1979, CS7935 PENNS STAT U