知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

26 条记录 (耗时 0.02 秒)

    Time-based decomposition for supply chain optimization problem
    3.
    发明授权
    Time-based decomposition for supply chain optimization problem 有权

    公开(公告)号：US11755967B2

    公开(公告)日：2023-09-12

    申请号：US18105717

    申请日：2023-02-03

    申请人： Blue Yonder Group, Inc.

    发明人： Devanand R ,  Narayan Nandeda ,  Tushar Shekhar

    IPC分类号： G06Q10/04 ,  G06Q10/0631

    CPC分类号： G06Q10/04 ,  G06Q10/06315

    摘要： 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.

    Time-Based Decomposition for Supply Chain Optimization Problem
    4.
    发明公开
    Time-Based Decomposition for Supply Chain Optimization Problem 审中-公开

    公开(公告)号：US20230186186A1

    公开(公告)日：2023-06-15

    申请号：US18105717

    申请日：2023-02-03

    申请人： Blue Yonder Group, Inc.

    发明人： Devanand R ,  Narayan Nandeda ,  Tushar Shekhar

    IPC分类号： G06Q10/04 ,  G06Q10/0631

    CPC分类号： G06Q10/04 ,  G06Q10/06315

    摘要： 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.

    Time-based decomposition for supply chain optimization problem
    6.
    发明授权
    Time-based decomposition for supply chain optimization problem 有权

    公开(公告)号：US11586995B2

    公开(公告)日：2023-02-21

    申请号：US17739861

    申请日：2022-05-09

    申请人： Blue Yonder Group, Inc.

    发明人： Devanand R ,  Narayan Nandeda ,  Tushar Shekhar

    IPC分类号： G06Q10/04 ,  G06Q10/06 ,  G06Q10/0631

    摘要： 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.

    Image-based analytics of supply chain optimization problems
    7.
    发明授权
    Image-based analytics of supply chain optimization problems 有权

    公开(公告)号：US11461866B1

    公开(公告)日：2022-10-04

    申请号：US16886681

    申请日：2020-05-28

    申请人： Blue Yonder Group, Inc.

    发明人： Devanand R ,  Narayan Nandeda ,  Tushar Shekhar

    IPC分类号： G06Q50/28 ,  G06Q10/06 ,  G06T11/00 ,  G06T11/20

    摘要： A system and method are disclosed for image analysis of supply chain planning problems modeled as a linear programming (LP) problems. Embodiments include receiving an LP matrix representing constraints and variables of at least a portion of a supply chain planning problem, generating a sorted variable index for the variables of the LP matrix, generating a sorted constraint index for the constraints of the LP matrix, identifying functions of the variables and the constraints, selecting one or more colors of pixels of a supply chain problem image based, at least in part, on the identified functions of the variables and constraints, selecting locations of the pixels, and displaying a visualization of the supply chain problem image.

    Domain-aware decomposition for supply chain master planning using linear programming
    8.
    发明授权
    Domain-aware decomposition for supply chain master planning using linear programming 有权

    公开(公告)号：US12112295B2

    公开(公告)日：2024-10-08

    申请号：US18543678

    申请日：2023-12-18

    申请人： Blue Yonder Group, Inc.

    发明人： Devanand R ,  Narayan Nandeda ,  Tushar Shekhar

    IPC分类号： G06Q10/087 ,  G06F17/12 ,  G06F17/13 ,  G06Q10/04

    CPC分类号： G06Q10/087 ,  G06F17/12 ,  G06F17/13 ,  G06Q10/04

    摘要： 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.

    Time-based decomposition for supply chain optimization problem
    9.
    发明授权
    Time-based decomposition for supply chain optimization problem 有权

    公开(公告)号：US11972373B2

    公开(公告)日：2024-04-30

    申请号：US18232162

    申请日：2023-08-09

    申请人： Blue Yonder Group, Inc.

    发明人： Devanand R ,  Narayan Nandeda ,  Tushar Shekhar

    IPC分类号： G06Q10/04 ,  G06Q10/0631

    CPC分类号： G06Q10/04 ,  G06Q10/06315

    摘要： 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.