TY  - JOUR
A1  - Rambau, Jörg
A1  - Schwarz, Cornelius
T1  - Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing
N2  - 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.
KW  - Industrieroboter
KW  - Zusammenstoß
KW  - Dynamische Optimierung
KW  - Komplexität
KW  - Branch-and-Bound-Methode
KW  - Gemischt-ganzzahlige Optimierung
KW  - Tourenplanung
KW  - robot dispatching
KW  - collisions
KW  - routing and scheduling
KW  - mixed integer programming
KW  - branch and bound
Y1  - 2010
UR  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:703-opus-7369
UR  - http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/584
ER  -