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

  • SCHWARZ A BSTRACT. Motivated
  • Published 2010

Abstract

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… (More)

Topics

20 Figures and Tables

Cite this paper

@inproceedings{Motivated2010ExploitingCR, title={Exploiting Combinatorial Relaxations to Solve a Routing & Scheduling Problem in Car Body Manufacturing}, author={SCHWARZ A BSTRACT. Motivated}, year={2010} }