Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 2069-2083

  Chengbin, Chu ^a   Rémy, La ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Absolute worst case performance ratios; Approximation algorithms; Variable sized bin packing

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; ONE DIMENSIONAL; PERFORMANCE; PROBLEM SOLVING;

ABSOLUTE WORST-CASE PERFORMANCE RATIOS; APPROXIMATION ALGORITHMS; LARGEST OBJECT FIRST WITH LEAST ABSOLUTE WASTE; LARGEST OBJECT FIRST WITH RELATIVE WASTE; LEAST ABSOLUTE WASTE; LEAST RELATIVE WASTE; VARIABLE-SIZED BIN PACKING;

APPROXIMATION THEORY;

EID: 33751137755     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s009753979834669x     Document Type: Article

References (18)

1. J. ANTONIO, F. CHAUVET, C. CHU, AND J. M. PROTII, The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming, European J. Oper. Res., 114 (1999), pp. 395-402.
2. B. BAKER, A new proof of the first-fit decreasing bin packing algorithm, J. Algorithms, 44 (1985), pp. 49-70.
3. C. CHU AND J. ANTONIO, Approximation algorithms to solve real-life multi-criteria cutting stock problems, Oper. Res., 47 (1999), pp. 495-508.
4. E. G. COFFMAN, JR., M. R. GAREY, AND D. S. JOHNSON, Approximation algorithms for bin packing: An updated survey, in Algorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini, eds., Springer, Berlin, 1983, pp. 49-106.
5. E. G. COFFMAN, JR., S. HALFIN, A. JEAN-MARIE, AND P. ROBERT, Stochastic analysis of a slotted FIFO communication channel, IEEE Trans. Inform. Theory, 39 (1993), pp. 1555-1566.
6. E. G. COFFMAN, JR., M. R. GAREY, AND D. S. JOHNSON, Bin packing approximation algorithms: A survey, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS, Boston, MA, 1996, pp. 46-93.
7. E. G. COFFMAN, JR., D. S. JOHNSON, P. W. SHOR, AND R. R. WEBER, Bin packing with discrete item sizes, part II: Tight bounds on first fit, Random Structures Algorithms, 10 (1997), pp. 69-101.
8. J. CSIRIK, An on-line algorithm for variable-sized bin packing, Acta Inform., 26 (1989), pp. 697-709.
9. D. K. FRIESEN AND M. A. LANGSTON, Variable sized bin packing, SIAM J. Comput., 15 (1986), pp. 222-230
10. M. GAREY, R. GRAHAM, D. JOHNSON, AND A. YAO, Resource constrained scheduling as generalized bin packing, J. Combin. Theory Ser. A, 21 (1985), pp. 257-298.
11. A. IVANYI, Tight Worst-Case Bounds for Bin Packing Algorithms, Colloq. Math. Soc. Jânos Bolyai 44, 1984, North-Holland, Amsterdam, pp. 233-240.
12. D. S. JOHNSON, Fast algorithms for bin packing, J. Comput. System Sei., 8 (1974), pp. 272-315.
13. [l3] C. C. LEE AND D. T. LEE, A simple on-line bin packing algorithm, J. Assoc. Comput. Mach., 32 (1985), pp. 562-572
14. W. MAO, Best-k-fit bin packing, Computing, 50 (1993), pp. 265-270.
15. W. MAO, Tight worst-case performance bounds for next-k-fit bin packing, SIAM J. Comput., 22 (1993), pp. 46-56.
16. F. D. MURGOLO, An efficient approximation scheme for variable-sized bin packing, SIAM J. Comput, 16 (1987), pp. 149-161.
17. D. SIMCHI-LEVI, New worst case results for the bin packing problem, Naval Res. Logist., 41 (1994), pp. 597-585
18. G. ZHANG, Worst-case analysis of the FFH algorithm for on-line variable-sized bin packing, Computing, 56 (1996), pp. 165-172.