Otto-von-Guericke-Universität Magdeburg


Management Science

Contact: Prof. Dr. Gerhard Wäscher, Chair of Management (Emeritus)

Cutting and packing problems exhibit an identical problem structure. Generally speaking, they can be characterized as geometric assignment problems, in which small (one-, two- or three-dimensional) items have to be assigned large objects, such that either the value of the large objects necessary to accommodate all small items is minimized (“input minimization”) or, if the availability of the large objects is limited, the value of the small items is maximized which can be assigned to the large objects (“output maximization”).  Such problems are encountered in very different environments, e.g. in paper factories where standard rolls have to be cut into width ordered by clients (“cutting”), in the steel industry where steel plates have to be cut down according to specifications from customers (“cutting”), in pallet and container loading (“packing”), and many others.  Recently, research at the Department of Management Science has particularly focused on (two-dimensional) cutting with defective materials and (three-dimensional) container loading.

Selected Publications
Afsharian, M.; Niknejad, A.; Wäscher, G. (2014): A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects. OR Spectrum 36, 971-999.
Bortfeldt, A.; Wäscher, G. (2013): Constraints in container loading - A state-of-the-art review. European Journal of Operational Research 229, 1-20.
Bortfeldt, A.; Jungmann, S. (2012): A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Annals of Operations Research 196, 53-71.
Wäscher, G.; Haußner, H.; Schumann, H. (2007): An improved typology of cutting and packing problems. European Journal of Operational Research 183, 1109-1130.

Contact: Prof. Dr. Gerhard Wäscher, Chair of Management Science (Emeritus)

Order picking involves the retrieval of articles from their storage locations at distribution warehouses in order to satisfy a given demand from customers. Planning and control of such operations is crucial for managing supply chains efficiently, since underperformance results in an unsatisfactory customer service and/or high costs. Recently, research at the Department of Management Science has focused on the following operative planning problems in manual order picking systems: (i) assignment of articles to storage locations in the warehouse (article location assignment), (ii) grouping of customer orders into picking orders (order batching), (iii) the determination of routes for the order pickers (picker routing), and (iv) the assignment of picking orders to order pickers (picking order assignment problem).

Selected Publications
Scholz, A.; Henn, S.; Stuhlmann, M.; Wäscher, G. (2016): A new mathematical programming formulation for the single-picker routing problem. In: European Journal of Operational Research 253, 68-84.
Henn, S. (2015): Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flexible Services and Manufacturing 27, 86-114.
Henn, S.; Koch, S.; Gerking, H.; Wäscher, G. (2013): A U-shaped Layout for Manual Order-Picking Systems. Logistics Research 6, 245-261.
Henn, S.; Koch, S.; Wäscher, G. (2012): Order Batching in Order Picking Warehouses: A Survey of Solution Approaches. In: Warehousing in the Global Supply Chain - Advanced Models, Tools and Applications for Storage Systems (Ed.: Manzini, R.). London: Springer, 105-137.

Contact: Prof. Dr. Gerhard Wäscher, Chair of Management Science (Emeritus)

Vehicle routing problems arise in a context where goods have to be delivered by several trucks from a central depot to customers at different locations and where the capacity of the trucks is limited. For each truck it has to be decided which customers should be served and the corresponding sequence must be determined such that the total length of all truck tours is minimized. Research at the Department of Management Science has recently focused on routing problems with multiple truck departments of flexible sizes and on the integration of container loading into vehicle routing problems.

Selected Publications
Bortfeldt, A.; Hahn, T.; Männel, D.; Mönch, L.: (2015): Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints. European Journal of Operational Research 243, 82-96.
Henke, T.; Speranza, M.G.; Wäscher, G. (2015): The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research 246, 730-746.
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.
Haußner, H.; Knauel, J.; Wäscher, G. (2008): Tourenplanung für den Menübringdienst des Deutschen Roten Kreuzes Magdeburg – Eine Fallstudie. In: Transformation in der Ökonomie – Festschrift für Gerhard Schwödiauer zum 65. Geburtstag (Hrsg.: Gischer, H.; et al.). Wiesbaden: Betriebswirtschaftlicher Verlag Dr. Th. Gabler, 289-309.

Letzte Änderung: 29.01.2018 - Contact Person: Webmaster