Faculty of Business, Economics and Statistics

Department of Business Administration

Chair of Production and Operations Management
(Lehrstuhl für Produktion und Logistik)
o. Univ.-Prof. Dipl.-Ing. Dr. Richard F. Hartl

 040051 KFK PM/SCM/TL: 

Seminar A (E)
4 ECTS points

"Cutting and Packing, Bin Packing"

Lecturer

Dates & Places

  • Tuesday 16:45-18:15 a.m. (Seminar-Room 1, Oskar-Morgenstern-Platz 1)
  • Starting on March 3, 2015

Study Programs

  • Mag. internationale Betriebswirtschaft (KFK Production Management,  KFK SupplyChain Management, KFK Transportation Logistics)
  • Mag. Betriebswirtschaft (KFK Production Management,  KFK Supply Chain Management, KFK Transportation Logistics)
  • partly also KFK Operations Research
  • QEM - Quantitative Economics Master

Course Content

  • This course (Seminar) will focus on "Cutting and Packing" and "Bin Packing". 
  • Basic models and approaches from the literature will be discussed and some recent research articles will be presented. 

Requirements

  • Regular presence and participation in discussion
  • Literature study
  • Presentation using slides (power Point or PDF)
  • Term paper (Seminararbeit)

Prerequisites

  • This course (Seminar) is intended as the final course in a KFK. Thus, it should only be taken after some other courses in the corresponding area have been successfully completed.
  • The topic is related to "Production Management", but it is not necessary, that the corresponding KFK course has been taken before. 
  • Minimum requirement for admission is
    • "Transportation Logistics (TL)", "Production Analysis", or "Supply Chain Management" (current "Studienplan")

Basic Literature  

  • Gerhard Wäscher, Heike Hausner, Holger Schumann:
    An improved typology of cutting and packing problems, 
    European Journal of Operational Research 183 (2007) 1109–1130.  >>  download


  • Edward G. Coffman, Janos Csirik, Gabor Galambos, Silvano Martello and Daniele Vigo:
    Bin Packing Approximation Algorithms: Survey and Classification,
    P.M. Pardalos et al. (eds.), Handbook of Combinatorial Optimization,
    Springer, New York, 2013.  
    >>  download
  • Andrea Lodi, Silvano Martello, Michele Monaci:
    Two-dimensional packing problems: A survey,
    European Journal of Operational Research141 (2002) 241–252  
     >>  download

Schedule "Würfelteil"

  • The first part of the course is a so called "Würfelseminar", i.e. certain topics are to be prepared by all participants. Every 10 minutes, say, a different person will be asked (at random -> Würfel) to present the next pages of the underlying literature. The purpose is
        (i) to obtain some common knowledge base by all participants, and 
        (ii) to facilitate discussion.
  • Literature for the "Würfelseminar": see "basic literature" above
Tentative schedule: 
  • March 3, 2015introductory session
  • March 10, 2015: Wäscher, Hausner, and Schumann (2007); see basic literature above
  • March 17, 2015 basic literature
  • March 24 , 2015: basic literature

Schedule "Spezialteil"

In the second part each group of typically 2 participants will be given a special topic which has to be prepared and presented some weeks later (mainly in June). Also a term paper (Seminararbeit) must be written on this topic.

 

Topic

Date

Team (max 2 students)

1

Metaheuristic based on best fit heuristic

Edmund K. Burke, Graham Kendall, Glenn Whitwell (2009):
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock Cutting Problem
INFORMS Journal on Computing
Vol. 21, No. 3, 505–516.  PDF

 2.6.

Cirikli,Yasemin,0749614,   
Orkun Kaan Özcan 0867673

2

Three dimensional Problems with balancing

Baldi M.M., Perboli G., Tadei R. (2012):

The three-dimensional knapsack problem  with  balancing constraints.

Applied Mathematics and Computation, vol. 218, n. 19, 9802-9818.  PDF

 backup

3

Variable sized bin-packing

Mohamed Haouari, MehdiSerairi (2009):
Heuristics for the variable sized bin-packing problem
Computers & Operations Research, vol. 36, 2877 - 2884.
 PDF

2.6.

Sofya Kalinushkina     (1263753),

Elena Prishchepo     (1268173)

4

2-dimensional bin packing with guillotine cuts

Krzysztof Fleszar (2013):

Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts,
Computers & Operations Research, Volume 40, Issue 1, Paes 463-474.
 PDF

 22.06

Se 14

Cristian Golovescu,     1050956

Mattes Gillardin,     1448784

5

Irregular shape bin packing with guillotine constraints

Han, Wei, Bennell, Julia A., Zhao, XiaoZhou and Song, Xiang (2013):
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints.
European Journal of Operational Research, 230 (3), 495-504.
 PDF

22.06

SE 14

 

Franziska Pfahnl 0801625,   
Sonja Hirner 0753235

6

Irregular shape bin packing

Eunice López-Camacho, Gabriela Ochoa, Hugo Terashima-Marín, Edmund K. Burke (2013):

An effective heuristic for the two-dimensional irregular bin packing problem,
Annals of Operations Research, Vol. 206, No. 1, 241-264.
 PDF

23.6.

Katrin Liebhart        (a1102687).
Ana Zioltikova     (a0903884)


7a

Packing and Routing (routing first,  packing second)

Fuellerer G, Doerner KF, Hartl R, Iori M. (1010):

Metaheuristics for vehicle routing problems with three-dimensional loading constraints.

European Journal of Operational Research 201, 751–9. 

PDF


backup
7b Packing and Routing (packing first, routing second)

Bortfeldt, A.; Homberger, J. (2013):
Packing first, routing second - a heuristic for the vehicle routing and loading problem.
Computers and Operations Research 40, 873-885.
 PDF

 23.6. Anna Kaushik, 1252460,
Jacopo Foroni, 1368313






Term paper (Seminararbeit)

© RFH Last update: %LASTUPDATE%