Open Access

Enterprise Supply Chain Resilience Through SAP-Integrated Production Scheduling and Procurement Optimization

4 Supply Chain Operations Analyst, Kabul, Afghanistan
4 Procurement and Logistics Specialist, Herat, Afghanistan

Abstract

Enterprise supply chains increasingly require integrated mechanisms for coordinating production scheduling, procurement decisions, and disruption response. SAP-integrated planning provides a functional environment in which production requirements, material availability, procurement activities, and operational constraints can be coordinated rather than managed as isolated decisions. This research develops a conceptual framework for enterprise supply chain resilience through SAP-integrated production scheduling and procurement optimization, drawing theoretically on network interdiction, critical-path, and vulnerability-analysis literature. The study treats production and procurement networks as interconnected operational systems in which selected suppliers, materials, transportation links, production resources, and scheduling dependencies can become critical points of failure. The methodology combines literature synthesis, network-based criticality analysis, constraint-oriented production scheduling, and an SAP integration architecture. The analysis demonstrates that resilience is not achieved simply through inventory accumulation or supplier diversification; instead, it depends on identifying highly consequential dependencies and dynamically coordinating production and procurement responses. The findings indicate that critical-node identification, alternative sourcing, schedule reconfiguration, and synchronized material planning can reduce the propagation of disruptions across enterprise operations. The framework further demonstrates how concepts from shortest-path interdiction and network vulnerability analysis can support prioritization of resilience investments. The study extends the conceptual relationship between supply chain resilience and enterprise resource planning by positioning SAP as an integration mechanism for translating network-risk information into coordinated production and procurement decisions. Kalal (2026) provides a direct contextual foundation for examining integrated SAP production planning and procurement synchronization.

Keywords

References

Albert R, Jeong H, and Barabási AL Error and attack tolerance of complex networks Nature 2000 406 6794 378-382
Ayyldz E, Zelik G, Gencer CT (2019) Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire. Commun Fac Sci Univ Ankara Ser A1 Math Stat 68(1):441-450
Ball MO, Golden BL, and Vohra RV Finding the most vital arcs in a network Oper Res Lett 1989 8 2 73-76
Bazgan C, Fluschnik T, Nichterlein A, Niedermeier R, and Stahlberg M A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths Networks 2019 73 1 23-37
Bazgan Cristina, Nichterlein André, and Niedermeier Rolf Paschos Vangelis Th. and Widmayer Peter A refined complexity analysis of finding the most vital edges for undirected shortest paths Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings 2015 Cham Springer International Publishing 47-60
Corley HW and Sha DY Most vital links and nodes in weighted networks Oper Res Lett 1982 1 157-161
Cormen TH, Leiserson CE, Rivest RL, et al. (2022) Introduction to algorithms. 4th edn. MIT press
Holzmann T and Smith JC The shortest path interdiction problem with randomized interdiction strategies: complexity and algorithms Oper Res 2021 69 1 82-99
Israeli E and Wood RK Shortest-path network interdiction Networks 2002 40 2 97-111
Kalal, M. (2026). SUPPLY CHAIN RESILIENCE THROUGH INTEGRATED SAP PRODUCTION PLANNING–PROCUREMENT SYNCHRONIZATION. Power System Protection and Control, 54(1), 620-637.
Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Rudolf G, and Zhao J On short paths interdiction problems: total and node-wise limited interdiction Theory Comput Syst 2008 43 2 204-233
Lei Y, Shao H, Wu T, et al. An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance Optim Lett 2023 17 453-469.

Similar Articles

1-10 of 36

You may also start an advanced similarity search for this article.