公开(公告)号：US20240320274A1

公开(公告)日：2024-09-26

申请号：US18124190

申请日：2023-03-21

Applicant: SAP SE

Inventor： Kiran Venkatarama ,  Sudhir Verma ,  Anupama Rakesh Singh ,  Ankit Lohiya ,  Raghuraj Shetty ,  Ishita Kriti ,  Rohan Koul ,  Anirudh Saraiya ,  Akhileswara Kumar Chatala ,  Suketu Nitin Dave ,  Rohit Kumar

IPC: G06F16/93 ,  G06F40/166 ,  G06F40/20 ,  G06N5/02

CPC classification number: G06F16/93 ,  G06F40/166 ,  G06F40/20 ,  G06N5/02

Abstract: Techniques for conserving system resources using smart document retention are disclosed. A computer system may identify a first portion of a plurality of documents as being decision-making documents based on each document in the first portion being scheduled for deletion within a specified period of time, identify a second portion of the plurality of documents as being non-decision-making documents based on each document in the second portion either being scheduled for deletion outside of the specified period of time or having been converted into and stored as a knowledge base document, and determine a corresponding level of similarity between each decision-making document and each non-decision-making document. The computer system may then cause identifications of a subset of the decision-making documents to be displayed on a computing device based on the corresponding level of similarity between each decision-making document in the subset and at least one of the non-decision-making documents.

公开(公告)号：US20240095648A1

公开(公告)日：2024-03-21

申请号：US17898843

申请日：2022-08-30

Applicant: SAP SE

Inventor： Somjit Bhowmick ,  Anirudh Saraiya ,  Srinivasan Ramanathan

IPC: G06Q10/08 ,  G06Q10/06

CPC classification number: G06Q10/083 ,  G06Q10/06311 ,  G06Q10/0633

Abstract: Given a set of port stations, a collection of forwarding orders to/from the port stations, and a set of available rail rakes along with their current schedules, a rake plan that maps order containers to rakes is generated. The optimization model is constrained by rake availability, rake capacity (the number of containers that can be accommodated by a rake), and the indivisibility of containers. The scheduling of the rail rakes can be represented as a sparse 3-dimensional binary matrix. Each element of the matrix indicates whether a particular rail rake is assigned to carry a particular container from a particular order in the next trip. The rail rake scheduling data can be used to generate communications from a rail rake planning server to multiple client devices, each client device associated with a different port station.