Patents by Inventor Christoph Eckert
Christoph Eckert 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).
-
Publication number: 20140172738Abstract: According to one general aspect, a method of transportation management may include receiving a request to transport a current freight unit from a current source location to a current destination location. The method may include selecting a prior shipment path based upon a similarity, as defined by a set of predefined criteria, between the current freight unit and a prior freight unit. The method may further include initializing a shipment path improver with the prior shipment path. The method may also include generating, via the shipment path improver, a current shipment path for the current freight unit from the current source location to the current destination location based upon the prior shipment path.Type: ApplicationFiled: December 14, 2012Publication date: June 19, 2014Inventors: Thomas Schulz, Kathrin Dyckerhoff, Thomas Engelmann, Christoph Eckert
-
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: 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
-
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