Patent application number | Description | Published |
20080282091 | Systems and Methods of Securing Resources Through Passwords - Disclosed is a method of authorizing access to an item that maintains a lockout count and blocks access to the item if the lockout count exceeds a predetermined value. One feature is that the invention “variably” increments the lockout count if the presented password fails to exactly match the stored password. In this process the invention increments the lockout count different amounts depending upon how closely the presented password matches the stored password. The invention also provides a methodology that allocates a plurality of the same passwords to a plurality of users who share the same userid. The invention allows continuous operation of the item being accessed by providing that each of the passwords has a different expiration date. Also, when dealing with situations where a plurality of users who share the same userid also share the same password, the invention maps information associated with the users to the password in a data file and periodically updates the data file. | 11-13-2008 |
20090210279 | Method for Simultaneously Considering Customer Support Dates and Customer Request Dates - The invention disclosed here is a method for achieving simultaneous consideration of multiple customer demand dates within an advanced planning system. The invention provides a method of production planning that considers multiple due dates. The invention solves a production planning model based upon the second (commit) date to produce a first solution, sorts the demand records in order of importance, and then re-solves the production planning model based upon the first (request) date to produce a second solution. The re-solving process is performed on each demand item in the sorted order of importance. The invention optimizes between the first solution and the second solution. Before re-solving the production planning model, the invention changes the lower bound constraints on backorder variables. The re-solving process changes the required date for a single demand item, and this re-solving process is repeated for all demand items that have a first (request) date that is before a corresponding required date. The invention reports the optimal solution produced during the optimizing process. The system and method integrate the consideration of multiple demand dates with an advanced planning system for optimizing established planning objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the division. | 08-20-2009 |
20090216583 | APPROXIMATING CYCLE TIMES WITHIN MATERIAL FLOW NETWORK - Approximating cycle times within a material flow network is disclosed. One embodiment includes assigning an approximate cycle time for completion of a part number PN within the material flow network by using a model that rounds the approximate cycle time to a nearest aggregate time period and adjusting the assigned approximate cycle time based on a mathematical function representing an aggregate accuracy of an aggregation of cycle times throughout the material flow network. | 08-27-2009 |
20090222312 | SUPPLY CONSUMPTION OPTIMIZATION AND MULTIPLE COMPONENT UTILITZATION - The invention disclosed here is a method for achieving simultaneous consideration of multiple independent dates associated with a single demand. The method iterates through the demands to match the demands with the supply quantities respecting demand priorities which vary over time and demand quantities which may perish over time. One embodiment of the invention allocates demand to supply through an iterative process beginning with earlier demand requirement dates and concluding with later demands which may preempt supply from earlier demands depending upon their relative priorities. An additional embodiment transforms the demands to create multiple demand records, each having an associated priority, such that a single original demand record is transformed into a plurality of related demand records, each having an associated priority. The component supply quantities are accumulated into period ending inventories. The method matches the multiple demand records (in priority sequence) to the period ending inventories. | 09-03-2009 |
20100280868 | METHOD FOR SIMULTANEOUSLY CONSIDERING CUSTOMER COMMIT DATES AND CUSTOMER REQUEST DATES - The invention disclosed here is a method for achieving simultaneous consideration of multiple customer demand dates within an advanced planning system. The invention provides a method of production planning that considers multiple due dates. The invention solves a production planning model based upon the second (commit) date to produce a first solution, sorts the demand records in order of importance, and then re-solves the production planning model based upon the first (request) date to produce a second solution. The re-solving process is performed on each demand item in the sorted order of importance. The invention optimizes between the first solution and the second solution. Before re-solving the production planning model, the invention changes the lower bound constraints on backorder variables. The re-solving process changes the required date for a single demand item, and this re-solving process is repeated for all demand items that have a first (request) date that is before a corresponding required date. The invention reports the optimal solution produced during the optimizing process. The system and method integrate the consideration of multiple demand dates with an advanced planning system for optimizing established planning objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the division. | 11-04-2010 |
20110199114 | BIT FAILURE SIGNATURE IDENTIFICATION - A method, system, and program product for identifying at least one bit failure among a plurality of semiconductor chips are provided. A first aspect of the invention provides a method of identifying at least one bit failure signature among a plurality of semiconductor chips, the method comprising: counting failures of each failing bit among the plurality of semiconductor chips; determining a most commonly failing bit (MCFB) among the failing bits; establishing a bit failure signature including the MCFB; counting failures of each failing bit on semiconductor chips on which the MCFB fails; determining a next most commonly failing bit (NMCFB) among the failing bits on semiconductor chips on which the MCFB fails; determining whether the NMCFB tends to fail when the MCFB fails; and in response to a determination that the NMCFB tends to fail when the MCFB fails, adding the NMCFB to the bit failure signature. | 08-18-2011 |
20110307087 | SYSTEMS AND METHODS OF RESCHEDULING MANUFACTURING RELEASES - Techniques are presented for rescheduling manufacturing releases. A plurality of release information elements are identified based on a first run of a first advanced planning system. The release information elements comprise dates of planned manufacturing release and quantity. The plurality of release information elements are sorted based on associated demand-likelihood factors and a plurality of sorting criteria. Swapping candidates are selected and swaps are performed based on the demand-likelihood factors and at least one swapping constraint. The plurality of release information elements are then fixed and output as results. A second run of an advanced planning system is optionally performed before output and may include stability features. | 12-15-2011 |