Patents by Inventor Jens Gottlieb
Jens Gottlieb has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9811797Abstract: A transportation management system may include a connection cache configured to store connection-relevant transportation information for transportation objects. The connection-relevant transportation information may have been replicated from at least one of a plurality of transportation object sources including at least a first database storing schedules, a second database storing freight bookings, and a third database storing freight orders. The transportation management system may also include a connection cache access engine configured to receive transportation parameters including at least a first location and a second location, and query the connection cache to dynamically select one or more transportation objects from the connection cache related to at least one of the schedules, the freight bookings, and the freight orders, that are relevant for the first location and the second location.Type: GrantFiled: March 15, 2013Date of Patent: November 7, 2017Assignee: SAP SEInventors: Marcus Zahn, Holger Huene, Jens Gottlieb
-
Publication number: 20140279661Abstract: A transportation management system may include a connection cache configured to store connection-relevant transportation information for transportation objects. The connection-relevant transportation information may have been replicated from at least one of a plurality of transportation object sources including at least a first database storing schedules, a second database storing freight bookings, and a third database storing freight orders. The transportation management system may also include a connection cache access engine configured to receive transportation parameters including at least a first location and a second location, and query the connection cache to dynamically select one or more transportation objects from the connection cache related to at least one of the schedules, the freight bookings, and the freight orders, that are relevant for the first location and the second location.Type: ApplicationFiled: March 15, 2013Publication date: September 18, 2014Inventors: Marcus Zahn, Holger Huene, Jens Gottlieb
-
Patent number: 8321258Abstract: Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicles and further configured to fit a set of compartments on those vehicles. The system may include attempts to fill each vehicle and the compartments of each vehicle. The system may include evaluating a set of constraints on the shipment. The constraints may include a complex logical statement.Type: GrantFiled: August 31, 2006Date of Patent: November 27, 2012Assignee: SAP AktiengeselleschaftInventors: Jens Gottlieb, Jochen Christoph Eckert, Thomas Engelmann, Carsten Schumm
-
Patent number: 8195496Abstract: Combining multiple objective functions to perform algorithmic problem solving is described. A first algorithm performs processing on a complex problem and generates multiple solutions to the problem. One or more solutions as generated by the first algorithm are send to one or more additional algorithms for further processing of complex sub-problems bounded by the first algorithm. The solutions to the first algorithm are used as input to the additional algorithms, where those solutions include at least one boundary condition under which the additional algorithms process the sub-problems. Ultimate solutions satisfy boundary conditions of the first algorithm, and all conditions of the additional algorithms. Algorithms may be executed in combinations of parallel and/or sequential operation to generate a final solution considering multiple different sub-problems to the complex problem.Type: GrantFiled: November 26, 2008Date of Patent: June 5, 2012Assignee: SAP AktiengesellschaftInventors: Jens Gottlieb, Lars Vogel
-
Patent number: 7983942Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.Type: GrantFiled: February 9, 2010Date of Patent: July 19, 2011Assignee: SAP AGInventors: Konstantin Malitski, Jens Gottlieb, Christoph Eckert
-
Publication number: 20100205026Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.Type: ApplicationFiled: February 9, 2010Publication date: August 12, 2010Applicant: SAP AGInventors: Konstantin Malitski, Jens Gottlieb, Christoph Eckert
-
Publication number: 20100131431Abstract: The embodiments of the invention relates to a transportation management system. Specifically the embodiments of the invention relate to a system and process for generating shipment orders, freight orders and tours automatically from planned transportation activity data. The process reduces planned transportation activity to a set of frames having minimal data to reduce processing time. The frames are then evaluated for soft and hard constraints to identify a set of shipment orders, freight orders and tours. The shipment orders, freight orders and tours are then augmented from the frame state to include the necessary data.Type: ApplicationFiled: November 26, 2008Publication date: May 27, 2010Applicant: SAP AGInventors: Andreas Esau, Jens Gottlieb, Holger Thiel
-
Publication number: 20100131444Abstract: Combining multiple objective functions to perform algorithmic problem solving is described. A first algorithm performs processing on a complex problem and generates multiple solutions to the problem. One or more solutions as generated by the first algorithm are send to one or more additional algorithms for further processing of complex sub-problems bounded by the first algorithm. The solutions to the first algorithm are used as input to the additional algorithms, where those solutions include at least one boundary condition under which the additional algorithms process the sub-problems. Ultimate solutions satisfy boundary conditions of the first algorithm, and all conditions of the additional algorithms. Algorithms may be executed in combinations of parallel and/or sequential operation to generate a final solution considering multiple different sub-problems to the complex problem.Type: ApplicationFiled: November 26, 2008Publication date: May 27, 2010Applicant: SAP AGInventors: Jens Gottlieb, Lars Vogel
-
Patent number: 7660732Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.Type: GrantFiled: June 30, 2004Date of Patent: February 9, 2010Assignee: SAP AGInventors: Konstantin Malitski, Jens Gottlieb, Christoph Eckert
-
Publication number: 20080077464Abstract: Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicle combinations, which are composed of a combination of vehicles and trailers. The system may include attempts to fill each vehicle and trailer in each vehicle combination. The system may include evaluating a set of constraints on the shipment. The process may include an optimization process to generate the most cost effective use of the available vehicle combinations.Type: ApplicationFiled: September 22, 2006Publication date: March 27, 2008Inventors: Jens Gottlieb, H. Thomas Engelmann, J. Christoph Eckert, Carsten G. Schumm
-
Publication number: 20080065262Abstract: Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicles and further configured to fit a set of compartments on those vehicles. The system may include attempts to fill each vehicle and the compartments of each vehicle. The system may include evaluating a set of constraints on the shipment. The constraints may include a complex logical statement.Type: ApplicationFiled: August 31, 2006Publication date: March 13, 2008Inventors: Jens Gottlieb, Jochen Christoph Eckert, Thomas Engelmann, Carsten Schumm
-
Publication number: 20070244677Abstract: A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.Type: ApplicationFiled: June 30, 2004Publication date: October 18, 2007Inventors: Konstantin Malitski, Jens Gottlieb, Christoph Eckert
-
Publication number: 20040107110Abstract: Methods and apparatus, including computer program products, for optimizing a total cost associated with transporting products on a set of vehicles. Orders representing products are assigned to one or more vehicles in the set. The assignment defines a sequence of pickup and delivery activities for the vehicles. One or more orders are deleted from one or more vehicles; at least one order from the deleted orders is inserted into a vehicle; the assignment is changed for at least one vehicle; and a cost is determined for the transportation of the products on the set of vehicles. The steps of deleting one or more orders, inserting at least one order, changing the assignment, and determining a cost, are repeated until an optimal cost has been determined.Type: ApplicationFiled: December 2, 2002Publication date: June 3, 2004Inventors: Jens Gottlieb, Christoph Eckert