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

메뉴 건너뛰기

Journal of Complexity

Volumn 3, Issue 4, 1987, Pages 406-428

Bin packing with divisible item sizes

(3) Coffman Jr , E G a Garey, M R a Johnson, D S a

a LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001500781 PISSN: 0885064X EISSN: 10902708 Source Type: Journal
DOI: 10.1016/0885-064X(87)90009-4 Document Type: Article

Times cited : (77)

References (17)

1
- 0000062025
- On a dual version of the one-dimensional bin packing problem
- (1984) J. Algorithms , vol.5 , pp. 502-525
- Assmann¹ Johnson² Kleitman³ Leung⁴

2
- 0002845781
- On packing two-dimensional bins
- (1982) SIAM Journal on Algebraic Discrete Methods , vol.3 , pp. 66-76
- Chung¹ Garey² Johnson³

3
- 0005029951
- Dynamic bin packing
- (1983) SIAM Journal on Computing , vol.12 , pp. 227-258
- Coffman¹ Garey² Johnson³

4
- 0002528075
- Approximation algorithms for bin packing—An updated survey
- G Ausiello, M Lucertini, P Serafini, Springer-Verlag, New York
- (1984) Algorithm Design for Computer System Design , pp. 49-106
- Coffman¹ Garey² Johnson³

5
- 0022106463
- Scheduling file transfers
- (1985) SIAM J. Comput. , vol.14 , pp. 744-780
- Coffman¹ Garey² Johnson³ LaPaugh⁴

6
- 0000586245
- Performance bounds for level-oriented two-dimensional packing algorithms
- (1980) SIAM Journal on Computing , vol.9 , pp. 808-826
- Coffman¹ Garey² Johnson³ Tarjan⁴

7
- 0008772723
- Combinatorial analysis of an efficient algorithm for processor and storage allocation
- (1979) SIAM Journal on Computing , vol.8 , pp. 202-217
- Coffman¹ Leung²

8
- 0008785637
- Bin packing: Maximizing the number of pieces packed
- (1978) Acta Inform. , vol.9 , pp. 263-271
- Coffman¹ Leung² Ting³

9
- 0001629328
- Maximizing the minimum processor finish time in a multiprocessor system
- (1982) SIAM Journal on Algebraic Discrete Methods , pp. 190-196
- Deuermeyer¹ Friesen² Langston³

10
- 0022662085
- Variable sized bin packing
- (1986) SIAM J. Comput. , vol.15 , pp. 222-230
- Friesen¹ Langston²

11
- 0001491336
- Resource constrained scheduling as generalized bin packing
- (1976) J. Combin. Theory Ser. A , vol.21 , pp. 257-298
- Garey¹ Graham² Johnson³ Yao⁴

12
- 0003603813
- Freeman, San Francisco
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey¹ Johnson²

13
- 0001653907
- Bounds on multiprocessor timing anomalies
- (1969) SIAM J. Appl. Math. , vol.17 , pp. 263-269
- Graham¹

14
- 0015672156
- A class of dynamic memory allocation algorithms
- (1973) Comm. ACM , vol.16 , pp. 615-618
- Hirschberg¹

15
- 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⁵

16
- 0003555976
- 2nd ed., Addison-Wesley, Reading, MA
- (1973) Fundamental Algorithms , vol.1
- Knuth¹

17
- 0010322740
- Complexity of scheduling problems
- E.G Coffman Jr., Wiley, New York
- (1975) Computer and Job-Shop Scheduling Theory , pp. 139-164
- Ullman¹

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