SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Combinatorial Theory, Series A

Volumn 21, Issue 3, 1976, Pages 257-298

Resource constrained scheduling as generalized bin packing

(4) Garey, M R a Graham, R L a Johnson, D S a Yao, Andrew Chi Chih b

a LUCENT TECHNOLOGIES (United States)

b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001491336 PISSN: 00973165 EISSN: 10960899 Source Type: Journal
DOI: 10.1016/0097-3165(76)90001-7 Document Type: Article

Times cited : (259)

References (16)

1
- 0003415652
- Chap. 10, Addison-Wesley, Reading, Mass.
- (1974) The Design and Analysis of Computer Algorithms
- Aho¹ Hopcroft² Ullman³

2
- 0016735997
- Worst case analysis of a placement algorithm related to storage allocation
- (1975) SIAM Journal on Computing , vol.4 , pp. 249-263
- Chandra¹ Wong²

3
- 0004063929
- Wiley, New York
- (1975) Computer and Job-Shop Scheduling Theory
- Coffman¹

4
- 0003287437
- Bounds for multiprocessor scheduling with resource constraints
- (1975) SIAM Journal on Computing , vol.4 , pp. 187-200
- Garey¹ Graham²

5
- 0001627504
- Complexity results for multiprocessor scheduling under resource constraints
- (1975) SIAM Journal on Computing , vol.4 , pp. 397-411
- Garey¹ Johnson²

6
- 84944813080
- Bounds for certain multiprocessing anomalies
- (1966) Bell System Technical Journal , vol.45 , pp. 1563-1581
- Graham¹

7
- 0014477093
- Bounds on multiprocessing timing anomalies
- (1969) SIAM Journal on Applied Mathematics , vol.17 , pp. 416-429
- Graham¹

8
- 0001430010
- Parallel scheduling and assembly line problems
- (1961) Operations Research , vol.9 , pp. 841-848
- Hu¹

9
- 84914425445
- O. H. Ibarra and C. H. Kim, “Fast approximation algorithms for the knapsack and sum of subset problems,” J. Assoc. Comput. Mach., to appear.

10
- 0003622855
- Near-optimal bin packing algorithms
- M.I.T, Cambridge, Mass.
- (1973) Doctoral thesis
- Johnson¹

11
- 0016069667
- Fast algorithms for bin packing
- (1974) J. Comput. System Sci. , vol.8 , pp. 272-314
- Johnson¹

12
- 0016349356
- Approximation algorithms for combinatorial problems
- (1974) J. Comput. System Sci. , vol.9 , pp. 256-278
- Johnson¹

13
- 0000339680
- Worst-case performance bounds for simple one-dimensional packing algorithms
- (1974) SIAM Journal on Computing , vol.3 , pp. 299-325
- Johnson¹ Demers² Ullman³ Garey⁴ Graham⁵

14
- 0003037529
- Reducibility among combinatorial problems
- R.E Miller, J.W Thatcher, Plenum Press, New York
- (1972) Complexity of Computer Computations , pp. 85-104
- Karp¹

15
- 84910965140
- Analysis of computer scheduling with memory constraints
- Computer Science Department, Purdue University
- (1973) Doctoral thesis
- Krause¹

16
- 84909514019
- Scheduling unit-time tasks with limited resources
- (1974) Proceedings Sagamore Computer Conference
- Yao¹

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