In this chapter, scheduling and routing principles are discussed. At the beginning, a typical case for operative decision making and mathematical graphs for the representation of decision situations in a network structure are introduced. Additionally, the first insights into the algorithmic processing of graph-data as the basic ingredient for decision making in network structures are provided. The consideration of complex restrictions during the deployment of a resource is discussed by means of the traveling salesman problem (TSP) in which the sequencing of operations to build a schedule for a resource is in the focus of the decision making. The integrated consideration of assignment and scheduling/sequencing decision problems under limited resource availability is addressed in the context of the capacitated vehicle routing problem (CVRP). Finally, a short introduction to the scheduling of the production machines is given. The chapter is completed by an E-Supplement providing additional case studies, Excel templates, tasks and video streams.