I2 Technologies Us, Inc.

I2 Technologies, Inc.

Narayan Venkatasubramanyan

Brian M Kennedy

James M Crawford, Jr

Mehdi Sheikhzadeh

Gregory H Slocum

Manoj Abraham

David John Michael

Wei Cao

Amanpreet Singh

Yap O Guan

Tiaohua Lin

Karel Zeithammer

Arun Kunchithapatham

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.

Generating a supply chain plan

A method for demand planning includes determining a demand value representing a demand quantity of an end product that a manufacturer is to produce. Production of the demand quantity of the end product includes production of a quantity of an intermediate product using a raw material. The intermediate product is to be further processed to produce the end product. The method also includes determining an additional quantity value representing an additional quantity of the intermediate product that the manufacturer can produce in addition to the quantity of the intermediate product used to produce the end product. At least one of the demand value and the additional quantity value is based at least partially on an exchange balance associated with at least one of the raw material, the intermediate product, and the end product. The method further includes making the additional quantity value for the intermediate product available for use in generating additional demand for the intermediate product.

Demand planning using exchange balances

A system and method for searching a problem space. In an exemplary application, the search constructs a plan associated with a business enterprise and the problem space is a model of the enterprise. The search is divided into subsearches. Each subsearch is performed by a subsearch process having its own goal data, termination data, problem data, problem selection process, move process, and script. The script of a subsearch determines whether the current state of the search shall be advanced by a move of that subsearch or by another subsearch.

Computer implemented system and method for high level controlled searching through a problem space

Growing community of inventors

Coppell, TX, United States of America

Narayan Venkatasubramanyan