Patents by Inventor Satyadeep Vajjala

Satyadeep Vajjala 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: 9507341
    Abstract: A supply chain management system for controlling component processes includes a computer device that is adapted to: detect a plurality of component processes; create a relative value of each one of the plurality of component processes; prioritize each one of the plurality of component processes according to sibling relationships; and control a flow of the plurality of component processes in a manufacturing line based on the prioritizing.
    Type: Grant
    Filed: April 19, 2013
    Date of Patent: November 29, 2016
    Assignee: GLOBALFOUNDRIES INC.
    Inventors: Manuel Parente, Kenneth D. Rocheleau, Satyadeep Vajjala
  • Publication number: 20140358621
    Abstract: According to an exemplary embodiment, a computer-implemented method for attempting to optimize a supply chain network (SCN) includes forecasting demand in the SCN based on a set of demand data. One or more time-dependent reorder points (ROPs) deemed to optimize the SCN are generated by a computer processor, based on the demand forecast, where each time-dependent ROP represents an ROP that changes over time. A simulation of operations of the SCN is performed, using the time-dependent ROPs.
    Type: Application
    Filed: September 9, 2013
    Publication date: December 4, 2014
    Applicant: International Business Machines Coproration
    Inventors: Anthony Bussani, Soojung Hong, Ban Kawas, Tim Nonner, Manuel Parente, Jean-Philippe Pellet, Ulrich Schimpel, Satyadeep Vajjala, Stefan Woerner
  • Publication number: 20140358619
    Abstract: According to an exemplary embodiment, a computer-implemented method for attempting to optimize a supply chain network (SCN) includes forecasting demand in the SCN based on a set of demand data. One or more time-dependent reorder points (ROPs) deemed to optimize the SCN are generated by a computer processor, based on the demand forecast, where each time-dependent ROP represents an ROP that changes over time. A simulation of operations of the SCN is performed, using the time-dependent ROPs.
    Type: Application
    Filed: May 28, 2013
    Publication date: December 4, 2014
    Applicant: International Business Machines Corporation
    Inventors: Anthony Bussani, Soojung Hong, Ban Kawas, Tim Nonner, Manuel Parente, Jean-Philippe Pellet, Ulrich Schimpel, Satyadeep Vajjala, Stefan Woerner
  • Publication number: 20120136758
    Abstract: Setting a plurality of reorder points for a plurality of products, the plurality of reorder points including a first reorder point and a second reorder point, the second reorder point greater than the first reorder point. Determining for one or more products, issuing one or more normal kanbans and one or more build ahead kanbans over one or more periods of time based on inventory levels and product demand. Approving for production in the current time period the one or more normal kanbans issued for the current time period. Determining if excess capacity exists to produce additional kanbans and approving for production in the current time period one or more of the build ahead kanbans in response to determining that excess capacity exists.
    Type: Application
    Filed: November 30, 2010
    Publication date: May 31, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Manuel Parente, Ulrich B. Schimpel, Satyadeep Vajjala
  • Patent number: 7103436
    Abstract: The invention provides a method and system for determining a production plan that includes a first step that determines the minimum number of manufacturing starts that are required to meet contractual obligations; and a second step which determines a production plan satisfying the minimum manufacturing starts together with other customer demands. More specifically, the invention presents a method of allocating production starts (e.g., wafer starts) in a manufacturing facility (e.g., wafer foundry) using a linear programming production planning system which performs a first stage of linear programming to satisfy only contractually mandated minimum production starts constraints followed by a second stage of linear programming to satisfy the additional constraints, once the minimum starts constraints are satisfied.
    Type: Grant
    Filed: January 29, 2004
    Date of Patent: September 5, 2006
    Assignee: International Business Machines Corporation
    Inventors: Brian T. Denton, Robert J. Milne, Robert A. Orzell, Satyadeep Vajjala, Jacqueline N. Ward
  • Publication number: 20050171625
    Abstract: The invention provides a method and system for determining a production plan that includes a first step that determines the minimum number of manufacturing starts that are required to meet contractual obligations; and a second step which determines a production plan satisfying the minimum manufacturing starts together with other customer demands. More specifically, the invention presents a method of allocating production starts (e.g., wafer starts) in a manufacturing facility (e.g., wafer foundry) using a linear programming production planning system which performs a first stage of linear programming to satisfy only contractually mandated minimum production starts constraints followed by a second stage of linear programming to satisfy the additional constraints, once the minimum starts constraints are satisfied.
    Type: Application
    Filed: January 29, 2004
    Publication date: August 4, 2005
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Brian Denton, Robert Milne, Robert Orzell, Satyadeep Vajjala, Jacqueline Ward