Skip to main content
SpringerLink
Log in

Algorithms for packing and scheduling problems

  • Published:
Quarterly Journal of the Belgian, French and Italian Operations Research Societies Aims and scope Submit manuscript

Abstract.

We survey the main results presented in the author’s Ph.D Thesis (Monaci 2001), discussed on January 2002 at the University of Bologna (Italy) and supervised by Paolo Toth and Silvano Martello. The thesis deals with exact and heuristic approaches for solving a class of combinatorial optimization problems, with particular emphasis on Two-Dimensional Packing problems and Scheduling problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. D.E.I.S., University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Michele Monaci

Authors
  1. Michele Monaci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michele Monaci.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Monaci, M. Algorithms for packing and scheduling problems. 4OR 1, 85–87 (2003). https://doi.org/10.1007/s10288-002-0011-1

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-002-0011-1

Keywords

Search

Navigation