SCOPUS 정보 검색 플랫폼

Volumn 10, Issue 3, 1975, Pages 384-393

NP-complete scheduling problems

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

MULTIPROCESSOR SCHEDULING;

COMPUTER SYSTEMS, DIGITAL;

EID: 0016518855 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/S0022-0000(75)80008-0 Document Type: Article

Times cited : (1067)

References (10)

1
- 85059358443
- Bounds on multiprocessing anomalies and packing algorithms
- (1972) Proc. SJCC , pp. 205-218
- Graham¹

2
- 85059770931
- The complexity of theorem proving procedures
- (1970) Proc. 3rd ACM Conference on Theory of Computing , pp. 151-158
- Cook¹

3
- 0003898182
- Reducibility among combinatorial problems
- Department of Computer Science, University of California at Berkeley
- (1972) TR3
- Karp¹

5
- 0015772423
- Complete register allocation problems
- (1973) 5th Annual ACM Symp. on Theory of Computing
- Sethi¹

6
- 84880299672
- Scheduling independent tasks to reduce mean finishing time
- also see
- (1973) ACM SIGOPS Operating Systems Review , vol.7 , pp. 102-103
- Bruno¹ Coffman² Sethi³

7
- 0016080006
- Scheduling independent tasks to reduce mean finishing time
- (1974) CACM , vol.17 , pp. 382-387
- Bruno¹ Coffman² Sethi³

8
- 84909487371
- Complexity results for multiprocessor scheduling under resource constraints
- (1974) Proc. 8th Annual Princeton Conf. on Inf. Sci. and Systems
- Garey¹ Johnson²

9
- 0015482117
- Optimal scheduling for two-processor systems
- (1972) Acta. Inf. , vol.1 , pp. 200-213
- Coffman¹ Graham²

10
- 0014534836
- Optimal sequence of two equivalent processors
- (1969) SIAM Journal on Applied Mathematics , vol.17 , pp. 784-789
- Fuji¹ Kasami² Ninomiya³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.