Patents by Inventor Steve Igrejas
Steve Igrejas 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: 10839338Abstract: A predictive engine on a computer environment comprising a shared pool of configurable computing resources is executed to perform a predictive analysis on data pipelined into the computer environment, the data received from a plurality of sources and in a plurality of different formats, the predictive engine generating a network level cost information based on the predictive analysis on a dynamic and continuous basis. Asynchronous communication comprising the network level cost information from the predictive engine is received and a set of candidate nodes for order fulfillment is generated based on the network level cost information and a defined distance between the set of candidate nodes and a target destination. An optimization engine on the computer environment is invoked that filters the set of candidate nodes. A number of fulfillment nodes that meet one or more of a constraint and preconfigured rule is output.Type: GrantFiled: May 13, 2016Date of Patent: November 17, 2020Assignee: International Business Machines CorporationInventors: Sanjay E. Cheeran, Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Steve Igrejas, Ali Koc, Pradyumnha G. Kowlani, Yingjie Li, Ding Ding Lin, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Vadiraja S. Ramamurthy, Sachin Sethiya, Chek Keong Tan, Dahai Xing, Michael Yesudas, Xiaobo Zheng
-
Patent number: 10685319Abstract: A simulator is configured to simulate the fulfillment of orders by nodes. Each node has an inventory of products and is capable of shipping the products to destinations in response to receipt of a corresponding order. The simulator divides the nodes into groups and assigns a different priority to each group based on input provided by a user to the simulator to generate an ordered sequence of priorities. The simulator maintains safety stock data corresponding to each node that indicates minimum quantities of the products required to be present at the corresponding node. The simulator selects a current priority of the sequence and next simulates a first group among the groups having the current priority fulfilling the orders for a given product among the products while a quantity of the given product at each of the nodes in the first group is below the minimum quantity in the corresponding safety stock data.Type: GrantFiled: October 13, 2015Date of Patent: June 16, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: JoAnn Piersa Brereton, Ajay Ashok Deshpande, Arun Hampapur, Miao He, Alan Jonathan King, Xuan Liu, Christopher Scott Milite, Jae-Eun Park, Joline Ann Villaranda Uichanco, Songhua Xing, Steve Igrejas, Hongliang Fei, Vadiraja Ramamurthy, Yingjie Li, Kimberly D. Hendrix, Xiao Bo Zheng
-
Patent number: 10679178Abstract: A simulator is configured to simulate the fulfillment of orders by nodes. Each node has an inventory of products and is capable of shipping the products to destinations in response to receipt of a corresponding order. The simulator divides the nodes into groups and assigns a different priority to each group based on input provided by a user to the simulator to generate an ordered sequence of priorities. The simulator maintains safety stock data corresponding to each node that indicates minimum quantities of the products required to be present at the corresponding node. The simulator selects a current priority of the sequence and next simulates a first group among the groups having the current priority fulfilling the orders for a given product among the products while a quantity of the given product at each of the nodes in the first group is below the minimum quantity in the corresponding safety stock data.Type: GrantFiled: December 1, 2015Date of Patent: June 9, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: JoAnn Piersa Brereton, Ajay Ashok Deshpande, Arun Hampapur, Miao He, Alan Jonathan King, Xuan Liu, Christopher Scott Milite, Jae-Eun Park, Joline Ann Villaranda Uichanco, Songhua Xing, Steve Igrejas, Hongliang Fei, Vadiraja Ramamurthy, Yingjie Li, Kimberly D. Hendrix, Xiao Bo Zheng
-
Publication number: 20170228812Abstract: A method and system optimizing source selection of an online order with the lowest fulfillment cost by considering multiple types of parameters, including shipping costs, backlog costs and markdown savings of the order. The method includes obtaining an order from the order retrieval subsystem of the OMS, selecting the candidate sources, and retrieving data from retailers or shipping companies of each selected candidate sources. The system then calculates the costs and savings parameters of the candidate sources from the retrieved data. The system identifies all possible candidate sourcing selections of the order and calculates the total fulfillment cost of each sourcing selection of the order by adding the shipping costs with the backlog costs, and subtracting the markdown savings of all candidate sources in each sourcing selection. The system identifies the optimized sourcing selection of the order with the lowest fulfillment cost and renders the selection to the OMS.Type: ApplicationFiled: February 8, 2016Publication date: August 10, 2017Inventors: JoAnn P. Brereton, Ajay A. Deshpande, Hongliang Fei, Arun Hampapur, Miao He, Kimberly D. Hendrix, Steve Igrejas, Alan J. King, Yingjie Li, Xuan Liu, Christopher S. Milite, Jae-Eun Park, Vadiraja S. Ramamurthy, Joline Ann V. Uichanco, Songhua Xing, Xiao Bo Zheng
-
Publication number: 20170206481Abstract: A predictive engine on a computer environment comprising a shared pool of configurable computing resources is executed to perform a predictive analysis on data pipelined into the computer environment, the data received from a plurality of sources and in a plurality of different formats, the predictive engine generating a network level cost information based on the predictive analysis on a dynamic and continuous basis. Asynchronous communication comprising the network level cost information from the predictive engine is received and a set of candidate nodes for order fulfillment is generated based on the network level cost information and a defined distance between the set of candidate nodes and a target destination. An optimization engine on the computer environment is invoked that filters the set of candidate nodes. A number of fulfillment nodes that meet one or more of a constraint and preconfigured rule is output.Type: ApplicationFiled: May 13, 2016Publication date: July 20, 2017Inventors: Sanjay E. Cheeran, Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Steve Igrejas, Ali Koc, Pradyumnha G. Kowlani, Yingjie Li, Ding Ding Lin, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Vadiraja S. Ramamurthy, Sachin Sethiya, Chek Keong Tan, Dahai Xing, Michael Yesudas, Xiaobo Zheng
-
Publication number: 20160110735Abstract: A simulator is configured to simulate the fulfillment of orders by nodes. Each node has an inventory of products and is capable of shipping the products to destinations in response to receipt of a corresponding order. The simulator divides the nodes into groups and assigns a different priority to each group based on input provided by a user to the simulator to generate an ordered sequence of priorities. The simulator maintains safety stock data corresponding to each node that indicates minimum quantities of the products required to be present at the corresponding node. The simulator selects a current priority of the sequence and next simulates a first group among the groups having the current priority fulfilling the orders for a given product among the products while a quantity of the given product at each of the nodes in the first group is below the minimum quantity in the corresponding safety stock data.Type: ApplicationFiled: December 1, 2015Publication date: April 21, 2016Inventors: JoAnn Piersa Brereton, Ajay Ashok Deshpande, Arun Hampapur, Miao He, Alan Jonathan King, Xuan Liu, Christopher Scott Milite, Jae-Eun Park, Joline Ann Villaranda Uichanco, Songhua Xing, Steve Igrejas, Hongliang Fei, Vadiraja Ramamurthy, Yingjie Li, Kimberly D. Hendrix, Xiao Bo Zheng