-
公开(公告)号:US11605039B2
公开(公告)日:2023-03-14
申请号:US17745305
申请日:2022-05-16
Applicant: Blue Yonder Group, Inc.
Inventor: Devanand R , Narayan Nandeda , Tushar Shekhar
IPC: G06Q10/0631 , G06Q10/04 , G06V10/75
Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.
-
公开(公告)号:US20220261708A1
公开(公告)日:2022-08-18
申请号:US17739861
申请日:2022-05-09
Applicant: Blue Yonder Group, Inc.
Inventor: Devanand R , Narayan Nandeda , Tushar Shekhar
Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments further include receiving a multi-period matrix formulation of a least a portion of an LP supply chain master planning problem representing a supply chain planning problem for a supply chain network and having a planning horizon divided into time buckets separated by time-bucket boundaries, mapping constraints of the LP supply chain master planning problem and variables of the LP supply chain master planning problem to the time buckets, calculating a quantity of cross-over variables for the constraints and the time buckets, selecting one or more decomposition boundaries from the time-bucket boundaries, and formulating at least two time-based decomposed subproblems by decomposing the LP supply chain master planning problem at the one or more decomposition boundaries.
-
公开(公告)号:US11334827B1
公开(公告)日:2022-05-17
申请号:US16886684
申请日:2020-05-28
Applicant: Blue Yonder Group, Inc.
Inventor: Devanand R , Narayan Nandeda , Tushar Shekhar
Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.
-
公开(公告)号:US20250005478A1
公开(公告)日:2025-01-02
申请号:US18886526
申请日:2024-09-16
Applicant: Blue Yonder Group, Inc.
Inventor: Brenda Christy , Mayank Tiwari , Tushar Shekhar
IPC: G06Q10/0631 , G06F3/04815 , G06F3/04845 , G06Q10/08 , G06T19/00
Abstract: A system and method are disclosed to generate one or more mixed-reality visualizations and objects to facilitate efficient interaction with large volumes of data. Embodiments include a computer comprising a processor and memory and a mixed-reality display device comprising a display and one or more sensors. Embodiments generate a mixed-reality object comprising a first cuboid, the first cuboid comprising one or more adjustable display dimensions corresponding to one or more key process indicators (KPIs) and one or more cubelets divided along at least one of the one or more adjustable display dimensions. Embodiments display the mixed-reality object on the display, and adjust at least one of the one or more adjustable display dimensions in response to receiving a first input to the one or more sensors. In response to a second input, embodiments transform the one or more cubelets of the first cuboid.
-
公开(公告)号:US12099949B2
公开(公告)日:2024-09-24
申请号:US18527997
申请日:2023-12-04
Applicant: Blue Yonder Group, Inc.
Inventor: Devanand R , Narayan Nandeda , Tushar Shekhar
IPC: G06Q10/0631 , G06Q10/04 , G06V10/75
CPC classification number: G06Q10/06315 , G06Q10/04 , G06Q10/06313 , G06V10/752
Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.
-
公开(公告)号:US20240296401A1
公开(公告)日:2024-09-05
申请号:US18662609
申请日:2024-05-13
Applicant: Blue Yonder Group, Inc.
Inventor: Narayan Nandeda , Phani Bulusu , Rashid Puthiyapurayil , Tushar Shekhar , Vidhi Chugh , Vishal Shinde
IPC: G06Q10/0631 , G06Q10/04
CPC classification number: G06Q10/06315 , G06Q10/04
Abstract: A system and method for efficiently determining the fair-share bands of a supply chain planning problem modeled as a multi-objective hierarchical linear programming problem include a processor and memory and are configured to model a supply chain planning problem as a multi-objective hierarchal linear programming problem, assign weights at each band of a fixed number of at least two bands, determine a direction of improved band values from a value of a Key Process Indicator (KPI) calculated from an expected demand and short quantities, wherein the expected demand and short quantities are calculated from the multi-objective hierarchical linear programming problem using a sample generated by Gibbs sampling of a conditional Gaussian Bayesian Network, and generate a supply chain plan.
-
公开(公告)号:US20240144614A1
公开(公告)日:2024-05-02
申请号:US18406948
申请日:2024-01-08
Applicant: Blue Yonder Group, Inc.
Inventor: Brenda Christy , Mayank Tiwari , Tushar Shekhar
IPC: G06T19/00 , G06F3/01 , G06Q10/0639 , G06Q10/087 , G06T19/20
CPC classification number: G06T19/006 , G06F3/013 , G06F3/017 , G06Q10/06393 , G06Q10/087 , G06T19/20
Abstract: A system and method are disclosed to generate mixed-reality visualizations and objects to facilitate efficient interaction with large volumes of data. Embodiments include a computer comprising a processor and memory and configured to select data stored in a data table coupled to the computer. Embodiments select one or more key process indicators (KPIs), dimensions by which to display the selected data, and color schemes by which to display the selected data. Embodiments generate a first mixed-reality object displaying the selected data according to the selected one or more KPIs, dimensions, and color schemes, and a second mixed-reality object displaying the selected data as a three-dimensional model of nodes and connections. Embodiments display the first and second mixed-reality objects on a display device, and manipulate one of the first and second mixed-reality objects in response to input received by one or more sensors.
-
公开(公告)号:US20240119413A1
公开(公告)日:2024-04-11
申请号:US18543678
申请日:2023-12-18
Applicant: Blue Yonder Group, Inc.
Inventor: Devanand R. , Narayan Nandeda , Tushar Shekhar
IPC: G06Q10/087 , G06F17/12 , G06F17/13 , G06Q10/04
CPC classification number: G06Q10/087 , G06F17/12 , G06F17/13 , G06Q10/04
Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving an LP problem representing a supply chain planning problem for a supply chain network comprising material buffers and resource buffers, partitioning the supply chain network at a complicating node into at least two supply chains sharing the complicating node, formulating a decomposed subproblem for each of the supply chains, calculating an effective dual based, at least in part, on a mathematical difference of at least two dual values calculated by solving the functional-based decomposed subproblems, and generating a globally-optimal LP solution to the LP problem using subgradient descent with the effective dual.
-
公开(公告)号:US11875292B2
公开(公告)日:2024-01-16
申请号:US18111749
申请日:2023-02-20
Applicant: Blue Yonder Group, Inc.
Inventor: Devanand R , Narayan Nandeda , Tushar Shekhar
IPC: G06Q10/0631 , G06Q10/04 , G06V10/75
CPC classification number: G06Q10/06315 , G06Q10/04 , G06Q10/06313 , G06V10/752
Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming problem. Embodiments include receiving a matrix formulation of at least a portion of the linear programming problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an linear programming subproblem from each of the at least two partitions, and solving the linear programming subproblems to generate a global solution to the supply chain planning problem.
-
30.
公开(公告)号:US20230419213A1
公开(公告)日:2023-12-28
申请号:US18244072
申请日:2023-09-08
Applicant: Blue Yonder Group, Inc.
Inventor: Ankit Shankdhar , Arijit Deb , Chaitanya Pai Kalasa Gopinath , Devender Pal Singh Chauhan , Tushar Shekhar
IPC: G06Q10/0631 , G06Q10/067 , G06N5/01 , G06Q10/04 , G06Q10/087 , G06Q30/0202
CPC classification number: G06Q10/06315 , G06Q10/067 , G06N5/01 , G06Q10/04 , G06Q10/06316 , G06Q10/087 , G06Q30/0202
Abstract: A system and method are disclosed including a planner having a processor and memory. The planner models a supply chain network over a planning horizon having one or more time buckets and a production line to produce one or more products using one or more campaign operations and one or more campaignable resources. The planner further formulates a supply chain master planning problem comprising a hierarchy of objective functions and one or more constraints and segments a campaign planning problem into three stages. The planner solves a first stage to determine prioritized production demands on campaignable buffers, solves a second stage to determine a timing and a sequence for allocating campaignable resources to campaignable buffers, and solves a third stage to determine a quantity of products to produce on campaignable resources.
-
-
-
-
-
-
-
-
-