I2 Technologies, Inc.

Texas Instruments Corporation

John C Hogge

Brian M Kennedy

James M Crawford, Jr

LaMott G Oren

A software system (2) utilizing a filtered priority queue (10) is provided. A filtering module (4) is operable to access a plurality of data records of entities (16, 18, 20, 22, 24, 26 and 28) of a-priority queue and to filter and arrange the data records in a memory storage device (8) to form the filtered priority queue (10). The filtered priority queue (10) comprises a remaining set (12) and a filtered set (14). The filtered set (14) contains a first subset of data records (20, 22, 24, 26, and 28). The first subset of data records (20, 22, 24, 26, and 28) form sublevels of a lattice. The remaining set (12) contains a second subset of data records (16 and 18). The second subset of data records (16 and 18) comprise lattice heads of the lattice. A sorting module (6) is coupled to the filtering module (4). The sorting module (6) is operable to access the remaining set (12) and to order the data records (16 and 18) in the second subset of data records to identify a data record (16) of a most critical entity.

Software system utilizing a filtered priority queue and method of

A planning coordination system (30) and method are provided that automatically coordinate a planning system (32) associated with a first factory (28) with separate planning systems (16, 24, 40) of a plurality of factories (12, 20, 36) in a manufacturing chain. The planning coordination system (30) communicates with the planning system (32) of the first factory (28) and communicates with separate planning coordination systems (14, 38) of the other factories (12, 36) with which the first factory (28) has demand and supply part relationships. The planning coordination system (30) receives and processes demands and responses communicated by the planning coordination systems (14, 38) of the other factories (12, 36). The planning coordination system (30) provides planning information to the planning system (32) of the first factory (28) and obtains information about products to be produced and parts needed from an output plan (34) of that planning system (32). The planning coordination system (30) communicates responses to the planning coordination system (14) of each factory (12) from which a demand was received in order to provide supply part information and communicates a demand to the planning coordination system (38) of each factory (36) from which parts are needed in order to provide demand part information. The planning coordination system (30) repeats receiving, processing, providing, obtaining and communicating such that the planning system (32) of the first factory (30) can adjust the output plan (34) responsive to the demands and responses communicated between the first factory (28) and the other factories (12, 36).

Planning coordination systems for coordinating separate factory planning

A system is provided for optimizing a network plan. The system includes a memory which stores information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients. Each interaction coefficient corresponds to particular constraint. A processor is coupled to the memory. The processor is operable to determine whether the network plan violates any of the constraints, modify the network plan in order to resolve a violation of any constraint, and update a corresponding interaction coefficient in order to reflect an impact upon the network plan caused by the resolution of a violation.

System for optimizing a network plan and method of operation

A software system (2) utilizing a filtered priority queue (10) is provided. A filtering module (4) is operable to access a plurality of data records of entities (16, 18, 20, 22, 24, 26 and 28) of a priority queue and to filter and arrange the data records in a memory storage device (8) to form the filtered priority queue (10). The filtered priority queue (10) comprises a remaining set (12) and a filtered set (14). The filtered set (14) contains a first subset of data records (20, 22, 24, 26, and 28). The first subset of data records (20, 22, 24, 26, and 28) form sublevels of a lattice. The remaining set (12) contains a second subset of data records (16 and 18). The second subset of data records (16 and 18) comprise lattice heads of the lattice. A sorting module (6) is coupled to the filtering module (4). The sorting module (6) is operable to access the remaining set (12) and to order the data records (16 and 18) in the second subset of data records to identify a data record (16) of a most critical entity.

Apparatus and method for production planning in a manufacturing facility is provided. The apparatus and method generates a plurality of theoretical plans and a constraint-based model for receiving one of the theoretical production plans, and applying at least one constraint thereto. Further, a cost function is computed for the theoretical production plans. Then, the apparatus and method searches for a feasible production plan among the plurality of theoretical plans, where the feasible plan is the plan which does not violate the applied constraint and has the least computed cost function.

Growing community of inventors

Richardson, TX, United States of America

John C Hogge