Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing

DOI10.1080/10556788.2013.768993zbMath1282.90244OpenAlexW2016985188MaRDI QIDQ5746704

Cornelius Schwarz, Jörg Rambau

Publication date: 7 February 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2013.768993

zbMATH Keywords

branch and boundmakespancollision-freeresource sharingrobot dispatching

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Uses Software

• GCG

Cites Work

• Resource extension functions: properties, inversion, and generalization to segments
• Vehicle Routing Problems with Inter-Tour Resource Constraints
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW

This page was built for publication: Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing