Exploiting Combinatorial Relaxations to Solve a Routing & Scheduling Problem in Car Body Manufacturing

@inproceedings{Schwarz2010ExploitingCR,
  title={Exploiting Combinatorial Relaxations to Solve a Routing & Scheduling Problem in Car Body Manufacturing},
  author={Cornelius Schwarz and A BSTRACT},
  year={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.