Patents by Inventor Thomas Engelmann

Thomas Engelmann 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: 20140172738
    Abstract: 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: Application
    Filed: December 14, 2012
    Publication date: June 19, 2014
    Inventors: Thomas Schulz, Kathrin Dyckerhoff, Thomas Engelmann, Christoph Eckert
  • Patent number: 8321258
    Abstract: 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: Grant
    Filed: August 31, 2006
    Date of Patent: November 27, 2012
    Assignee: SAP Aktiengeselleschaft
    Inventors: Jens Gottlieb, Jochen Christoph Eckert, Thomas Engelmann, Carsten Schumm
  • Publication number: 20080077464
    Abstract: 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: Application
    Filed: September 22, 2006
    Publication date: March 27, 2008
    Inventors: Jens Gottlieb, H. Thomas Engelmann, J. Christoph Eckert, Carsten G. Schumm
  • Publication number: 20080065262
    Abstract: 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: Application
    Filed: August 31, 2006
    Publication date: March 13, 2008
    Inventors: Jens Gottlieb, Jochen Christoph Eckert, Thomas Engelmann, Carsten Schumm
  • Patent number: 7310561
    Abstract: Identifying an operation that is critical to meeting a due date of a production order includes identifying operations associated with the production order, obtaining schedules for the operations using infinite production planning, obtaining start intervals for the operations based on the schedules, selecting a target operation from the operations, and determining whether the target operation is critical to meeting the due date based on whether the target operation can be scheduled, using finite production planning, in a start interval obtained for the target operation.
    Type: Grant
    Filed: March 30, 2005
    Date of Patent: December 18, 2007
    Assignee: SAP AG
    Inventors: Sonja Barnet, Hans-Juergen Biegler, Thomas Engelmann, Matthias Gressler, Thorsten Kulick, Bernhard Lokowandt, Thomas Schulz
  • Publication number: 20060271420
    Abstract: A system and method are described for performing bucket-oriented capacity checks on resources to determine whether activities can be processed prior to a desired delivery date.
    Type: Application
    Filed: May 27, 2005
    Publication date: November 30, 2006
    Inventors: Peter Anselmann, Stefan Siebert, Stefan Wedner, Tesfaldet Negash, Thomas Engelmann, Thomas Schulz, Thorsten Kulick, Tobias Scheuer, Volkmar Soehner, Anton Forstreuter, Bernhard Lokowandt, Christian Fuhlbruegge, Chrstian Embacher, Daniel Booss, Hans-Juergen Biegler, Heinrich Braun, Jan Osternmeier, Joachim Altmeyer
  • Publication number: 20060184263
    Abstract: Identifying an operation that is critical to meeting a due date of a production order includes identifying operations associated with the production order, obtaining schedules for the operations using infinite production planning, obtaining start intervals for the operations based on the schedules, selecting a target operation from the operations, and determining whether the target operation is critical to meeting the due date based on whether the target operation can be scheduled, using finite production planning, in a start interval obtained for the target operation.
    Type: Application
    Filed: March 30, 2005
    Publication date: August 17, 2006
    Inventors: Sonja Barnet, Hans-Juergen Biegler, Thomas Engelmann, Matthias Gressler, Thorsten Kulick, Bernhard Lokowandt, Thomas Schulz
  • Publication number: 20060143063
    Abstract: Methods, systems and computer program products are provided for allocating resources in a plannable process, wherein a number of resources is used for executing an order comprising a chain of related activities to be executed on the number of resources. In one implementation, a method comprises, for each order, identifying a first activity execution due date for executing a predetermined first activity in the order, scheduling an execution date for each activity according to a just-in-time criterion in correspondence with an activity execution due date of a related activity, identifying a second activity execution date for executing a predetermined second activity in the order that is scheduled according to the scheduling routine, and reversely scheduling an execution date for each activity according to a just-in-time criterion in correspondence with an activity execution due date of a reverse related activity, wherein the second activity execution date is kept fixed as a second activity execution due date.
    Type: Application
    Filed: December 29, 2005
    Publication date: June 29, 2006
    Inventors: Heinrich Braun, Thomas Engelmann, Martin Hentschel