SCOPUS 정보 검색 플랫폼

Volumn 158, Issue 15, 2010, Pages 1668-1675

Tighter bounds of the First Fit algorithm for the bin-packing problem

Author keywords

Bin packing; First Fit; Worst case performance ratio

Indexed keywords

ABSOLUTE PERFORMANCE; BIN PACKING; BIN PACKING PROBLEM; FIRST FIT; WORST-CASE PERFORMANCE RATIO;

PHOTOVOLTAIC EFFECTS;

BINS;

EID: 77955430655 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/j.dam.2010.05.026 Document Type: Article

Times cited : (73)

References (11)

1
- 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 Journal of Algorithms 6 1985 49 70
- (1985) Journal of Algorithms , vol.6 , pp. 49-70
- Baker, B.S.¹

2
- 0002026363
- Approximation algorithm for bin packing: A survey
- E.G. Coffman, M.R. Garey, and D.S. Johnson Approximation algorithm for bin packing: a survey D. Hochbaum, Approximation Algorithms for N P -Hard Problems 1997 PWS Publishing 46 93
- (1997) Approximation Algorithms for N P-Hard Problems , pp. 46-93
- Coffman, E.G.¹ Garey, M.R.² Johnson, D.S.³

3
- 38049049887
- The tight bound of first fit decreasing bin-packing algorithm is FFD(L) ≤ 11/9 OPT(L)+6/9
- G. Dósa The tight bound of first fit decreasing bin-packing algorithm is FFD(L) ≤ 11/9 OPT(L)+6/9 Lecture Notes in Computer Science 4614 2007 1 11
- (2007) Lecture Notes in Computer Science , vol.4614 , pp. 1-11
- Dósa, G.¹

4
- 0001491336
- Resource constrained scheduling as generalized bin packing
- M.R. Garey, R.L. Graham, D.S. Johnson, and A.C.C. Yao Resource constrained scheduling as generalized bin packing Journal of Combinatorial Theory, Series A 21 1976 257 298
- (1976) Journal of Combinatorial Theory, Series A , vol.21 , pp. 257-298
- Garey, M.R.¹ Graham, R.L.² Johnson, D.S.³ Yao, A.C.C.⁴

5
- 0003603813
- Freeman San Francisco
- M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of N P -Completeness 1978 Freeman San Francisco
- (1978) Computers and Intractability: A Guide to the Theory of N P-Completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 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.¹

7
- 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 Journal on Computing 3 1974 299 325
- (1974) SIAM Journal on Computing , vol.3 , pp. 299-325
- Johnson, D.S.¹ Demers, A.² Ullman, J.D.³ Garey, M.R.⁴ Graham, R.L.⁵

8
- 0004170086
- 5th ed. John Wiley & Sons
- I. Niven, H.S. Zuckerman, and H.L. Montgomery An Introduction to the Theory of Numbers 5th ed. 1991 John Wiley & Sons
- (1991) An Introduction to the Theory of Numbers
- Niven, I.¹ Zuckerman, H.S.² Montgomery, H.L.³

9
- 0028445097
- New worst-case results for the bin-packing problem
- D. Simchi-Levi New worst-case results for the bin-packing problem Naval Research Logistics 41 1994 579 585
- (1994) Naval Research Logistics , vol.41 , pp. 579-585
- Simchi-Levi, D.¹

10
- 1842603084
- Technical Report 100, Princeton University, Princeton, NJ
- J.D. Ullman, The performance of a memory allocation algorithm, Technical Report 100, Princeton University, Princeton, NJ, 1971.
- (1971) The Performance of A Memory Allocation Algorithm
- Ullman, J.D.¹

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

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