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

메뉴 건너뛰기

Journal of Algorithms

Volumn 37, Issue 2, 2000, Pages 237-246

The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items

(1) Xu, Kaihong a,b

a Texas A and M University (United States)

b INSTITUTE OF APPLIED MATHEMATICS (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346109297 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1006/jagm.2000.1103 Document Type: Article

Times cited : (6)

References (15)

1
- 0003622855
- Doctoral Thesis, MIT, Cambridge, MA
- D. S. Johnson, "Near-Optimal Bin Packing Algorithms," Doctoral Thesis, MIT, Cambridge, MA, 1973.
- (1973) Near-Optimal Bin Packing Algorithms
- Johnson, D.S.¹

2
- 38249002898
- The parametric behavior of the first-fit decreasing bin packing algorithm
- J. Csirik, The parametric behavior of the first-fit decreasing bin packing algorithm, J. Algorithms 15 (1993), 1-28.
- (1993) J. Algorithms , vol.15 , pp. 1-28
- Csirik, J.¹

3
- 0004239668
- American Elsevier, New York
- A. R. Brown, "Optimum Packing and Depletion," American Elsevier, New York, 1971.
- (1971) Optimum Packing and Depletion
- Brown, A.R.¹

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

5
- 0003603813
- Freeman, San Francisco
- p-Completeness," Freeman, San Francisco, 1979.
- (1979) p-Completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 84944813080
- Bounds for certain multiprocessing anomalies
- R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Tech. J. 45 (1966), 1563-1581.
- (1966) Bell System Tech. J. , vol.45 , pp. 1563-1581
- Graham, R.L.¹

7
- 0001653907
- Bounds on Multiprocessing Anomalies
- R. L. Graham, Bounds on Multiprocessing Anomalies, SIAM J. Appl. Math. 17 (1969), 263-269.
- (1969) SIAM J. Appl. Math. , vol.17 , pp. 263-269
- Graham, R.L.¹

8
- 0000339680
- Worst-case performance bounds for simple one-dimensional packing algorithms
- D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey and R. L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput. 3 (1974), 299-325.
- (1974) SIAM J. Comput. , vol.3 , pp. 299-325
- Johnson, D.S.¹ Demers, A.² Ullman, J.D.³ Garey, M.R.⁴ Graham, R.L.⁵

9
- 0002296629
- A new proof for the first-fit decreasing bin-packing algorithm
- B. S. Baker, A new proof for the first-fit decreasing bin-packing algorithm, J. Algorithms 6 (1985), 49-70.
- (1985) J. Algorithms , vol.6 , pp. 49-70
- Baker, B.S.¹

10
- 0041636797
- A simple proof of the inequality FFD(L) ≤ 11/9OPT(L) + 1, for all L, for the FFD bin-packing algorithm
- M. Yue, A simple proof of the inequality FFD(L) ≤ 11/9OPT(L) + 1, for all L, for the FFD bin-packing algorithm, Acta. Math. Appl. Sinica 7 (1991), 321-331.
- (1991) Acta. Math. Appl. Sinica , vol.7 , pp. 321-331
- Yue, M.¹

11
- 0001923235
- An application of bin-packing to multiprocessor scheduling
- E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, An application of bin-packing to multiprocessor scheduling, SIAM J. Comput. 7 (1987), 1-17.
- (1987) SIAM J. Comput. , vol.7 , pp. 1-17
- Coffman E.G., Jr.¹ Garey, M.R.² Johnson, D.S.³

12
- 15344349285
- On the exact upper bound for the multific processor scheduling algorithm
- M. Yue, On the exact upper bound for the multific processor scheduling algorithm, Ann. Oper. Res. 24 (1990), 233-260.
- (1990) Ann. Oper. Res. , vol.24 , pp. 233-260
- Yue, M.¹

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

14
- 0008937811
- Approximation algorithms for bin packing problems - A survey
- (G. Ausiello and M. Lucertini, Eds.), Springer-Verlag, New York
- M. R. Garey and D. S. Johnson, Approximation algorithms for bin packing problems - A survey, in "Analysis and Design of Algorithms in Combinatorial Optimization" (G. Ausiello and M. Lucertini, Eds.), pp. 147-172, Springer-Verlag, New York, 1981.
- (1981) Analysis and Design of Algorithms in Combinatorial Optimization , pp. 147-172
- Garey, M.R.¹ Johnson, D.S.²

15
- 0021374487
- Tighter bounds for the multific processor scheduling algorithm
- D. K. Friesen, Tighter bounds for the multific processor scheduling algorithm, SIAM J. Comput. 13 (1984), 170-181.
- (1984) SIAM J. Comput. , vol.13 , pp. 170-181
- Friesen, D.K.¹

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