Skip to main content
SpringerLink
Log in

An On-Line Algorithm for the Rectangle Packing Problem with Rejection

  • Conference paper
  • First Online:
Experimental and Efficient Algorithms (WEA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2647))

Included in the following conference series:

Abstract

In this paper an on-line algorithm for the Rectangle Packing Problem is presented. The method is designed to be able to accept or reject incoming boxes to maximize efficiency. We provide a wide computational analysis showing the behavior of the proposed algorithm as well as a comparison with existing off-line heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beasley, J. E.: An exact two-dimensional non-guillotine cutting tree search procedures. Operation Research 33 (1985) 49–64

    Article  MATH  MathSciNet  Google Scholar 

  2. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)

    Google Scholar 

  3. Blitz, D. Van Vliet, A., Woeginger, G. J.: Lower bounds on the asymptotic worst case ratio of the on-line bin packing problem. Unpublished manuscript (1996)

    Google Scholar 

  4. Confessore, G., Dell’Olmo, P., Giordani, S.: Complexity and approximation results for scheduling multiprocessor tasks on a ring. Discrete Applied Mathematics, (to appear)

    Google Scholar 

  5. Csirik, J., Van Vliet, A.: An on-line algorithm for multidimensional bin packing. Operations Research Letters 13 (1993) 149–158

    Article  MATH  MathSciNet  Google Scholar 

  6. Drozdowski, M.: Scheduling multiprocessor task. An overview. European Journal of Operations Research 94 (1996) 215–230

    Article  MATH  Google Scholar 

  7. Fiat, A. (ed.), Woeginger, G. J. (ed): Online Algorithms: The State of the Art. Lecture Notes in Computer Science, Vol. 1442. Springer-Verlag, Berlin Heidelberg (1998)

    Google Scholar 

  8. Haessler, R. W., Sweeney, P. E.: Cutting stock problems and solution procedures. European Journal of Operational Research 54 (1991) 141–150

    Article  MATH  Google Scholar 

  9. Hochbaum, D. S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the Association for Computing Machinery 32(1) (1985) 130–136

    MATH  MathSciNet  Google Scholar 

  10. Hopper, E., Turton, B. C. H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 1281 (2001) 34–57

    Article  MATH  Google Scholar 

  11. Hopper, E., Turton, B. C. H.: A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems. Artificial Intelligence Review 164 (2001) 257–300

    Article  MATH  Google Scholar 

  12. Lee, C. C., Lee, D. T.: A simple on-line bin packing algorithm, Journal of ACM 32 (1985) 562–572

    Article  MATH  Google Scholar 

  13. Leung, J., Tam, T., Wong, C. S., Young, G., Chin, F.: Packing squares into square. Journal of Parallel and Distributed Computing 10 (1990) 271–275

    Article  MathSciNet  Google Scholar 

  14. Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 379–396

    Article  MATH  MathSciNet  Google Scholar 

  15. Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research 141 (2002) 241–252

    Article  MATH  MathSciNet  Google Scholar 

  16. Imreh, C.: Online strip packing with modifiable boxes. Operation Research Letters 29 (2001), 79–85

    Article  MATH  MathSciNet  Google Scholar 

  17. Shmoys, D., Wien, J., Williamson, D. P.: Scheduling parallel machines on-line. SIAM Journal of Computing 24 (1995) 1313–1331

    Article  MATH  Google Scholar 

  18. Wu, Y. L., Huang, W., Lau, S. C., Wong, C. K., Young, G. H.: An effective quasi-human based heuristic for solving the rectangle packing problem. European Journal of Operational Research 141 (2002) 341–358

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto per le Applicazioni del Calcolo “M. Picone”, Viale del Policlinico, 137, 00161, Rome, Italy

    Massimiliano Caramia

  2. Dipartimento di Informatica, Sistemi e Produzione, University of Rome “Tor Vergata”, Via del Politecnico, 1, 00133, Rome, Italy

    Stefano Giordan & Antonio Iovanella

  3. Centro Interdipartimentale “Vito Volterra”, University of Rome “Tor Vergata”, Via Columbia 2, I-00133, Rome, Italy

    Stefano Giordan

Authors
  1. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Giordan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Iovanella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen  & Marian Margraf  & 

  2. IDISIA - Instituto Dalle Molle di Studi sull’Intelligenza Artificiale, Galleria 2, 6928, Manno, Switzerland

    Monaldo Mastrolilli

  3. Université de Genève 4, Switzerland

    José D. P. Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caramia, M., Giordan, S., Iovanella, A. (2003). An On-Line Algorithm for the Rectangle Packing Problem with Rejection. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds) Experimental and Efficient Algorithms. WEA 2003. Lecture Notes in Computer Science, vol 2647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44867-5_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44867-5_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40205-3

  • Online ISBN: 978-3-540-44867-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation