Refine
Year of publication
- 2010 (1) (remove)
Document Type
- Article (1) (remove)
Keywords
- Branch-and-Bound-Methode (1)
- Dynamische Optimierung (1)
- Gemischt-ganzzahlige Optimierung (1)
- Industrieroboter (1)
- Komplexität (1)
- Tourenplanung (1)
- Zusammenstoß (1)
- branch and bound (1)
- collisions (1)
- mixed integer programming (1)
-
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.
