Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.

Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g.

Abstract: Disclosed is a method of controlling a manufacturing system. The invention automatically monitors current levels of partially completed products waiting to be processed by a tool (or group of tools) and determines whether the current levels exceed a predetermined limit. If the current levels do exceed the predetermined limit, the invention performs an optimization process. However, if the current levels do not exceed the predetermined limit, the invention performs a dispatching process. In this dispatching process, the invention automatically projects future levels of partially completed products that will be supplied to the tool to identify a future work-in-process (WIP) bubble. The WIP bubble occurs when larger than normal amounts of partially completed products are supplied to the tool. The invention automatically adjusts the operating parameters of the tool based upon both the current levels and the future levels.

Abstract: The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan. the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g.

Abstract: 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.

Abstract: A method of iterative negotiation for improved production planning between one or more purchasers and suppliers in a supply chain. The method includes a purchaser in a supply chain generating a request schedule that is communicated to a supplier. In response to the request schedule the supplier generates a commit schedule and communicates it back to the purchaser. Through the iterative negotiation process (ask-answer) one or more interpolation constraints are generated based on the supplier's commit schedules. Upon completion of the ask-answer process purchaser solves a final advanced planning system (APS) based on said one or more interpolation constraints and generates a final production plan. The invention can be employed to integrate the collaboration among purchasers and suppliers 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).

Abstract: Method, system and program product for planning production for complementary demands are disclosed. In one embodiment, a method includes obtaining complementary demand values including at least one daily going rate (DGR) demand and a service demand; running a first planning production model in which the at least one DGR demand is included and the service demand is excluded; and running a second planning production model in which DGR related variables are fixed to values determined in the first planning production model and the service demand is included. Demands that are only considered by one of the planning production models are considered complementary demands.

Abstract: The present invention provides a method, system, and computer program product for controlling the flow of material in a manufacturing facility using an extended zone of control. A method in accordance to an embodiment of the present invention comprises establishing an extended zone of control including a high impact tool set and at least one other tool set, analyzing projected job arrivals at the high impact tool set, and adjusting a flow of material between the high impact tool set and the at least one other tool set based on the analysis of projected job arrivals at the high impact tool set.

Abstract: The present invention provides a method, system, and computer program product for improved flow of development lots in a manufacturing facility. A method in accordance to one embodiment of the present invention comprises: establishing at least one target for processing of a set of development lots in the manufacturing facility; monitoring a progress of the set of development lots in the manufacturing facility; comparing the progress of the set of development lots against the at least one target; establishing at least one suggested action for the set of development lots if the progress of the set of development lots deviates from the at least one target; and deciding which development lots in the set of development lots to assign to at least one tool in the manufacturing facility, wherein the at least one suggested action is incorporated into the assignment decision.

Abstract: A method, system, and program storage device for implementing the method of controlling a manufacturing system, wherein the method comprises providing a plurality of workpieces to be processed on a processing tool, the plurality of workpieces located at processing stations prior to the processing tool, determining auxiliary equipment allocation needs for the processing tool based on characteristics associated with the plurality of workpieces prior to the workpieces arriving at the processing tool, and sending auxiliary equipment to the processing tool based on the allocation needs prior to the workpieces arriving at the processing tool. According to an embodiment of the invention, the processing tool comprises a photolithographic system, the auxiliary equipment comprises a reticle, and the plurality of workpieces comprise semiconductor substrates.

Abstract: An exemplary embodiment of the invention relates to a method, system, and storage medium for integrating rework operations into an advanced planning process. The method comprises: providing at least one rework Bill of Materials flow for use in conjunction with other Bills of Materials flow in a production planning process; forecasting rework parametric information associated with the rework Bill of Materials flow; and generating an integrated manufacturing plan utilizing the rework parametric information and the rework Bill of Materials flow. The rework parametric information includes at least one of: yields; cycle times; capacities; and rework materials. Other embodiments of the invention include a system, and a storage medium.

Abstract: Disclosed is a method of controlling a manufacturing system. The invention automatically monitors current levels of partially completed products waiting to be processed by a tool (or group of tools) and determines whether the current levels exceed a predetermined limit. If the current levels do exceed the predetermined limit, the invention performs an optimization process. However, if the current levels do not exceed the predetermined limit, the invention performs a dispatching process. In this dispatching process, the invention automatically projects future levels of partially completed products that will be supplied to the tool to identify a future work-in-process (WIP) bubble. The WIP bubble occurs when larger than normal amounts of partially completed products are supplied to the tool. The invention automatically adjusts the operating parameters of the tool based upon both the current levels and the future levels.

Abstract: The invention provides a method and system for determining a production plan that includes a first step that determines the minimum number of manufacturing starts that are required to meet contractual obligations; and a second step which determines a production plan satisfying the minimum manufacturing starts together with other customer demands. More specifically, the invention presents a method of allocating production starts (e.g., wafer starts) in a manufacturing facility (e.g., wafer foundry) using a linear programming production planning system which performs a first stage of linear programming to satisfy only contractually mandated minimum production starts constraints followed by a second stage of linear programming to satisfy the additional constraints, once the minimum starts constraints are satisfied.

Abstract: A system and method for utilizing computer-implementable decision support systems to determine factory schedules. Methodologies associated with the invention include advanced planning systems, optimization and heuristic based algorithms, constraint-based programming, and simulation. The method may iteratively assign lots to non-full batches based on comparison of the resulting impact to mean flow time with the continuously approximated cost per batch. Once lots have been assigned to batches, potential interchanges of lots among batches are explored. If the variable cost per batch changes from one interchange to the next, the method may backtrack and attempt to re-allocate lots to batches based on the increased cost per batch.