IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v53y2006i4p298-308.html
   My bibliography  Save this article

Bin‐packing problem with concave costs of bin utilization

Author

Listed:
  • Chung‐Lun Li
  • Zhi‐Long Chen

Abstract

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006

Suggested Citation

  • Chung‐Lun Li & Zhi‐Long Chen, 2006. "Bin‐packing problem with concave costs of bin utilization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 298-308, June.
    • Handle: RePEc:wly:navres:v:53:y:2006:i:4:p:298-308
    DOI: 10.1002/nav.20142
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20142
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20142?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Scholl, Armin & Klein, Robert & Jürgens, Christian, 1996. "BISON : a fast hybrid procedure for exactly solving the one-dimensional bin packing problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49135, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Argote, L. & Epple, D., 1990. "Learning Curves In Manufacturing," GSIA Working Papers 89-90-02, Carnegie Mellon University, Tepper School of Business.
    3. J.M. Valério de Carvalho, 1999. "Exact solution of bin‐packing problems using column generation and branch‐and‐bound," Annals of Operations Research, Springer, vol. 86(0), pages 629-659, January.
    4. Shoshana Anily & Julien Bramel & David Simchi-Levi, 1994. "Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures," Operations Research, INFORMS, vol. 42(2), pages 287-298, April.
    5. Ronald J. Ebert, 1976. "Aggregate Planning with Learning Curve Productivity," Management Science, INFORMS, vol. 23(2), pages 171-182, October.
    6. A. K. Chakravarty & J. B. Orlin & U. G. Rothblum, 1982. "Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment," Operations Research, INFORMS, vol. 30(5), pages 1018-1022, October.
    7. A. K. Chakravarty & J. B. Orlin & U. G. Rothblum, 1985. "Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment," Operations Research, INFORMS, vol. 33(4), pages 820-834, August.
    8. S. Anily & A. Federgruen, 1991. "Structured Partitioning Problems," Operations Research, INFORMS, vol. 39(1), pages 130-149, February.
    9. Shmuel Gal & Boris Klots, 1995. "Optimal Partitioning Which Maximizes the Sum of the Weighted Averages," Operations Research, INFORMS, vol. 43(3), pages 500-508, June.
    10. Kang, Jangha & Park, Sungsoo, 2003. "Algorithms for the variable sized bin packing problem," European Journal of Operational Research, Elsevier, vol. 147(2), pages 365-372, June.
    11. Hoon Liong Ong & M. J. Magazine & T. S. Wee, 1984. "Probabilistic Analysis of Bin Packing Heuristics," Operations Research, INFORMS, vol. 32(5), pages 983-998, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Otto, Alena & Li, Xiyu, 2020. "Product sequencing in multiple-piece-flow assembly lines," Omega, Elsevier, vol. 91(C).
    2. Haouari, Mohamed & Mhiri, Mariem, 2024. "Lower and upper bounding procedures for the bin packing problem with concave loading cost," European Journal of Operational Research, Elsevier, vol. 312(1), pages 56-69.
    3. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.
    4. Wang, Ting & Hu, Qian & Lim, Andrew, 2022. "An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs," European Journal of Operational Research, Elsevier, vol. 300(1), pages 20-34.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gerard J. Chang & Fu-Loong Chen & Lingling Huang & Frank K. Hwang & Su-Tzu Nuan & Uriel G. Rothblum & I-Fan Sun & Jan-Wen Wang & Hong-Gwa Yeh, 1998. "Sortabilities of Partition Properties," Journal of Combinatorial Optimization, Springer, vol. 2(4), pages 413-427, December.
    2. Frank K. Hwang & Uriel G. Rothblum, 2011. "On the number of separable partitions," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 423-433, May.
    3. Huilan Chang & Frank K. Hwang & Uriel G. Rothblum, 2012. "A new approach to solve open-partition problems," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 61-78, January.
    4. Ekici, Ali, 2023. "A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1007-1020.
    5. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
    6. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.
    7. Hu, Qian & Lim, Andrew & Zhu, Wenbin, 2015. "The two-dimensional vector packing problem with piecewise linear cost function," Omega, Elsevier, vol. 50(C), pages 43-53.
    8. Ngwenyama, Ojelanki & Guergachi, Aziz & McLaren, Tim, 2007. "Using the learning curve to maximize IT productivity: A decision analysis model for timing software upgrades," International Journal of Production Economics, Elsevier, vol. 105(2), pages 524-535, February.
    9. Elhedhli, Samir, 2005. "Ranking lower bounds for the bin-packing problem," European Journal of Operational Research, Elsevier, vol. 160(1), pages 34-46, January.
    10. Mohamed Maiza & Abdenour Labed & Mohammed Radjef, 2013. "Efficient algorithms for the offline variable sized bin-packing problem," Journal of Global Optimization, Springer, vol. 57(3), pages 1025-1038, November.
    11. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    12. Liu, D.S. & Tan, K.C. & Huang, S.Y. & Goh, C.K. & Ho, W.K., 2008. "On solving multiobjective bin packing problems using evolutionary particle swarm optimization," European Journal of Operational Research, Elsevier, vol. 190(2), pages 357-382, October.
    13. Borja Ena & Alberto Gomez & Borja Ponte & Paolo Priore & Diego Diaz, 2022. "Homogeneous grouping of non-prime steel products for online auctions: a case study," Annals of Operations Research, Springer, vol. 315(1), pages 591-621, August.
    14. Libo Zhang & Qian Du & Dequn Zhou, 2021. "Grid Parity Analysis of China’s Centralized Photovoltaic Generation under Multiple Uncertainties," Energies, MDPI, vol. 14(7), pages 1-19, March.
    15. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    16. Singh, Anuraag & Triulzi, Giorgio & Magee, Christopher L., 2021. "Technological improvement rate predictions for all technologies: Use of patent data and an extended domain description," Research Policy, Elsevier, vol. 50(9).
    17. Stavins, Robert & Jaffe, Adam & Newell, Richard, 2000. "Technological Change and the Environment," Working Paper Series rwp00-002, Harvard University, John F. Kennedy School of Government.
    18. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    19. Javier Garcia-Sanchez & Luiz F. Mesquita & Roberto S. Vassolo, 2014. "What doesn't kill you makes you stronger: The evolution of competition and entry-order advantages in economically turbulent contexts," Strategic Management Journal, Wiley Blackwell, vol. 35(13), pages 1972-1992, December.
    20. Alain Desdoigts & Fernando Jaramillo, 2020. "Bounded Learning by Doing, Inequality, and Multi-Sector Growth: A Middle-Class Perspective," Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 36, pages 198-219, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:53:y:2006:i:4:p:298-308. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.