Refine
Document Type
- Article (3) (remove)
Language
- English (3) (remove)
Keywords
- Branch-and-Bound-Methode (2)
- Dynamische Optimierung (1)
- Gemischt-ganzzahlige Optimierung (1)
- Industrieroboter (1)
- Komplexität (1)
- Laser-Schweißen (1)
- NP-hartes Problem (1)
- Operations Research (1)
- Reihenfolgeproblem (1)
- Revenue Management (1)
-
Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings
(2006)
- We propose the new Top-Dog-Index to quantify the historic deviation of the supply data of many small branches for a commodity group from sales data. On the one hand, the common parametric assumptions on the customer demand distribution in the literature could not at all be supported in our real-world data set. On the other hand, a reasonably-looking non-parametric approach to estimate the demand distribution for the different branches directly from the sales distribution could only provide us with statistically weak and unreliable estimates for the future demand.
-
On the benefits of using NP-hard problems in Branch & Bound
(2008)
- We present a Brand-and-Bound (B&B) method using combinatorial bounds for solving makespan minimization problems with sequence dependent setup costs. As an application we present a laser source sharing problem arising in car manufacturing.
-
Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing
(2010)
- Motivated by the laser sharing problem (LSP) in car body manufacturing, we define the new general routing and scheduling problem (RSP). In the RSP, multiple servers have to visit and process jobs; renewable resources are shared among them. The goal is to find a makespan-minimal scheduled dispatch. We present complexity results as well as a branch-and-bound algorithm for the RSP. This is the first algorithm that is able to solve the LSP for industrially relevant problem scales.
