The Resource Transfer Problem
When considering real-world scheduling or routing problems, we generally face complex requirements that do not fit the standard problems assumed in the literature. Furthermore, scheduling and routing decisions which arise, for example, in the context of multi-site scheduling problems or the planning of supply chain operations, are often interdependent and lead to performance losses if they are considered separately using hierarchical planning approaches. This chapter introduces the resource transfer problem, a unifying modeling framework for integrated scheduling and routing problems. The first part is devoted to the generic problem. In the second part, we present a conceptual model and a mixed-integer problem formulation. The third part of this chapter is concerned with a graph-theoretical representation for instances of the resource transfer problem.
- Arnold V, Bardhan I, Cooper WW, Gallegos A (1998) Primal and dual optimality in computer codes using two-stage solution procedures in DEA. In: Aronson JE , Zionts S (eds) Operations research: methods, models and applications. Quorum Books, Westport, pp 57–96Google Scholar
- Bartusch M, Möhring RH, Radermacher FJ (1988) Scheduling project networks with resource constraints and time windows. Ann Oper Res 16(1–4):201–240Google Scholar
- Beck JC, Prosser P, Selensky E (2002) On the reformulation of vehicle routing problems and scheduling problems. International symposium on abstraction, reformulation, and approximation. Lecture notes in computer science, vol 2371. Springer, Berlin, pp 282–289Google Scholar
- Ehrenberg C (2015) Lösung komplexer Ablaufplanungsprobleme: Modelle, Methoden und Fallstudien. Shaker, AachenGoogle Scholar
- Roy B (1964) Physionomie et traitement des problèmes d’ordonnancement. In: Carré D, Darnaut P, Guitard P, Nghiem PT, Pacaud P, de Rosinski J, Roy B, Sandier G (eds) Les Problèmes d’Ordonnancement. Dunod, Paris, pp 1–18Google Scholar
- Schwindt C (1998a) Generation of resource-constrained project scheduling problems subject to temporal constraints. Technical Report WIOR-543, University of KarlsruheGoogle Scholar