Department of Business Decisions and Analytics

Scheduling and Packing

Integrating exact methods with analytics-based approaches

Obtaining optimal solutions for scheduling problems can still be a challenging task, even for small-size instances. Sophisticated bounding techniques and dominance rules are therefore vital ingredients for the development of tailored Branch-and-Bound algorithms. Further enhancements can be achieved by integrating predictive analytics, in order to decide which optimization components to run on which kinds of problems, for example. In addition to that, the analogy between packing problems and multiprocessor scheduling with unit-time tasks considerably extends the scope of optimization methods from both fields.

→ Further details: Prof. Dörner

Open brown cardboard boxes placed side by side
Photo by Luke Heibert on Unsplash