I2 Technologies Us, Inc.

Jda Software Group, Inc.

Manoj Abraham

Mehdi Sheikhzadeh

David John Michael

Narayan Venkatasubramanyan

Generating an order plan is disclosed. Data describing priority levels including at least one item request is accessed. Data describing a supply chain network () including network components () that supply one or more items to satisfy an item request is accessed. For each priority level, and for each item request of a priority level, an order for an item request of a current priority level is planned according to recorded unplannable network components () that are unable to satisfy an item request, and the unplannable network components () for the current priority level are determined. For each priority level, the unplannable network components () are validated for the current priority level, and the validated unplannable network components () for the current priority level are recorded. An order plan including the orders planned for the item requests at each priority level is provided.

Generating an order plan for a supply chain network

Generating an order plan is disclosed. Data describing priority levels including at least one item request is accessed. Data describing a supply chain network including network components that supply one or more items to satisfy an item request is accessed. For each priority level, and for each item request of a priority level, an order for an item request of a current priority level is planned according to recorded unplannable network components that are unable to satisfy an item request, and the unplannable network components for the current priority level are determined. For each priority level, the unplannable network components are validated for the current priority level, and the validated unplannable network components for the current priority level are recorded. An order plan including the orders planned for the item requests at each priority level is provided.

Generating a supply chain plan includes accessing data describing a supply chain network having buffers. Each buffer is operable to store items and is associated with a corresponding time variable. The supply chain network is constrained by a constraint. A linear programming problem is generated for the supply chain network. The linear programming problem is approximated by discretizing the time variables of the buffers to yield discretized time variables and by relaxing the constraint to yield a relaxed constraint. An optimized supply chain plan is calculated for the approximated linear programming problem. The optimized supply chain plan describes a quantity of items at each buffer for at least one time value of the corresponding time variable. The optimized supply chain plan is adjusted to satisfy the constraint.

Growing community of inventors

Dallas, TX, United States of America

Manoj Abraham