Optimizing Workforce Requirement Planning in Warehousing: Solving a Large-Scale MIP

The research for this thesis is conducted at flaschenpost SE, a German grocery delivery service. We aim to answer the following research question: How can the MIP model for the warehouse worker requirement planning of flaschenpost SE be solved as well as possible while reducing computational time as much as possible? To achieve this we solve a large-scale mixed integer linear programming problem (MILP or MIP) by using different techniques (both exact and heuristic).