References
- T. Achterberg, Constraint integer programming, PhD thesis, Technische Universität Berlin, 2007.
- P. Brucker and S. Knust, Complex Scheduling, Springer-Verlag, Berlin, Heidelberg, New York, 2006.
- J. Desroisers, Y. Dumas, M.M. Solomon, and F. Soumis, Time constraint routing and scheduling, in Handbooks in Operations Research and Management Science, Network Routing, M. Ball, T.L. Magnanti, C.L. Monma, and G. Nemhauser, eds., Vol. 8, Elsevier, Amsterdam, 1995, pp. 35–140.
- M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper. Res. 42(5) (1994), pp. 977–978. doi: 10.1287/opre.42.5.977
- M. Fischetti, A. Lodi, and P. Toth, Exact methods for the asymmetric traveling salesman problem, in The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen, eds., Kluwer Academic Publishers, Dordrecht, Vol. 12, 2002, pp. 169–205.
- G. Gamrath and M. Lübbecke, Experiments with a generic Dantzig–Wolfe decomposition for integer programs, in Experimental Algorithms, P. Festa, ed., Vol. 6049, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2010, pp. 239–252.
- M. Grötschel, H. Hinrichs, K. Schröer, and A. Tuchscherer, Ein gemischt-ganzzahliges lineares Optimierungsproblem für ein Laserschweißproblem im Karosseriebau, Zeitschrift für wissenschaftlichen Fabrikbetrieb 5 (2006), pp. 260–264.
- C. Hempsch and S. Irnich, Vehicle routing problems with inter-tour resource constraints, in The Vehicle Routing Problem. Latest Advances and New Challenges, B. Golden, S. Raghavan, and E. Wasil, eds., Springer, New YorkNY, Operations Research/Computer Science Interfaces Series 43, 2008, pp. 421–444
- IBM, CPLEX Mathematical Programming Software. Available at http://www-01.ibm.com/software/integration/optimization/cplex-optimization-studio/.
- S. Irnich, Resource extension functions: Properties, inversion, and generalization to segments, OR Spectrum 30(1) (2008), pp. 113–148. doi: 10.1007/s00291-007-0083-6
- S. Knust, Shop-scheduling problems with transportation, PhD thesis, Universiät Osnabrück, 2000.
- J. Rambau and C. Schwarz, On the benefits of using NP-hard problems in branch & bound, Operations Research Proceedings 2008, Springer-Verlag, Berlin, Heidelberg, 2009, pp. 463–468.
- J. Rambau and C. Schwarz, How to Avoid Collisions in Scheduling Industrial Robots? Preprint (2010), Universität Bayreuth. Available at http://opus.ub.unibayreuth.de/opus4ubbayreuth/frontdoor/index/index/docId/583.
- J. Schauer and C. Schwarz, A Generalized Job-Shop Problem with more than one Resource Demand per Task, preprint (2011), Universität Graz and Universität Bayreuth.
- K. Schröer, On the industrial relevant scales of laser sharing problems at VW, personal communication, 2012.
- C. Schwarz and J. Rambau, Optimal dispatching of welding robots, Slides for the 13th Combinatorial Optimization Workshop, Aussois, France, January 2009. Available at http://comopt.ifi.uni-heidelberg.de/conferences/aussois2009/program.html.
- P. Toth and D. Vigo (ed.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications 9, SIAM, Society for Industrial and Applied Mathematics, Philadelphia, PA, xviii, 2002, 367 p.
- W. Welz, Route Planning for Robot Systems, Diplomarbeit, Technische Universität Berlin, 2010.
- W. Welz and M. Skutella, Route planning for robot systems, Operations Research Proceedings 2010, B. Hu, K. Morasch, S. Pickl, and M. Siegle, eds., Springer, Heidelberg, 2011, pp. 307–312.