Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing

URN to cite this document: urn:nbn:de:bvb:703-opus-7369

Title data

Rambau, Jörg ; Schwarz, Cornelius:
Exploiting combinatorial relaxations to solve a routing & scheduling problem in car body manufacturing.
Bayreuth , 2010

	Format: PDF Name: rambau_schwarz.pdf Version: Published Version Available under License Creative Commons BY 3.0: Attribution
	Download (818kB)
	Format: PDF Name: rambau_schwarz_preprint.pdf Version: Preprint Available under License Creative Commons BY 3.0: Attribution
	Download (905kB)

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 algorithm for the RSP. This is the first algorithm that is able to solve the LSP for industrially relevant problem scales.

Further data

Item Type:	Preprint, postprint
Keywords:	Industrieroboter; Zusammenstoß; Dynamische Optimierung; Komplexität; Branch-and-Bound-Methode; Gemischt-ganzzahlige Optimierung; Tourenplanung; robot dispatching; collisions; routing and scheduling; mixed integer programming; branch and bound
DDC Subjects:	500 Science > 510 Mathematics
Institutions of the University:	Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties Faculties > Faculty of Mathematics, Physics und Computer Science
Language:	English
Originates at UBT:	Yes
URN:	urn:nbn:de:bvb:703-opus-7369
Date Deposited:	25 Apr 2014 09:30
Last Modified:	27 Mar 2019 13:48
URI:	https://epub.uni-bayreuth.de/id/eprint/411

Download Statistics

Download Statistics

Download Statistics

Downloads

Downloads per month over past year