Abstract: Disclosed are embodiments of a production planning method, system and program storage device. The embodiments calculate and compare, in sequence, a first running cumulative sum of the average item quantity per a regular time interval for all demands within a specified time period and a second running cumulative sum of specific item quantities per the same regular interval for only high priority demands within the same time period. When a given entry in the first running cumulative sum is less than a corresponding entry in the second running cumulative sum, demand leveling is performed. Comparing and demand leveling are iteratively repeated until no entries in the first running cumulative sum, as updated, are less than corresponding entries in the second running cumulative sum. The results can then be used for production planning in order to achieve near-capacity manufacturing and meet at least the high priority customer demands.

Abstract: The invention provides a method of rescheduling timing of when items on purchase orders are scheduled to be received in a linear programming production planning system. This methodology performs a pre-processing rescheduling of the timing of purchase order receipts into the earliest time period allowable in a pre-processing step. After this pre-processing, the invention solves the core production planning system equations using the rescheduled purchase order receipts. Then, the invention performs post-processing rescheduling, which sorts the purchase order receipts according to rescheduling flexibility, and subsequently sequentially reschedules the timing of each of the purchase order receipts in the order established by the sorting process. This process of sequentially rescheduling reschedules the timing of purchase order receipts into the latest time period allowable.

Abstract: A production planning technique inputs demands for products. Each of the demands having multiple due dates, and the multiple due dates having different priorities. An explosion process utilizing linear programming and heuristics is performed 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 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: 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 methodology disclosed herein calculates the dates that product must come to stock for every component in the supply chain as needed to meet exit demands associated with a plurality of due dates and priorities. Every planned product stock is thus associated with multiple stock dates and associated priorities as is every planned manufacturing start and every shipment.

Abstract: A method, a system for practicing the method and a storage device storing the method for identifying product assets in a supply chain used to satisfy customer demands. The method including: receiving a feasible schedule of all components to be assembled into products; receiving customer schedules for delivery of the products; and generating from the feasible schedule, from the customer schedules and from bills of materials listing all components required for a particular product, a set of demand pegging records, the demand pegging records associating a quantity and an availability date of each component of each product with a required quantity of each of the products, each demand pegging record consistent with the feasible schedule.

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: 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: A method determines production starts in a manufacturing environment by inputting production starts. The method groups the production starts into production lots according to grouping rules and assigns start dates and associated priorities to each of the production lots based on business priorities. Each production start date of a production lot can have a different priority. The method sorts the production lots according to the associated priorities and the start dates. Then the method capacitates the production lots by iterating through the production lots to assign production capacity to the production lots in order of the associated priorities and the start dates.

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: A method determines production starts in a manufacturing environment by inputting production starts. The method groups the production starts into production lots according to grouping rules and assigns start dates and associated priorities to each of the production lots based on business priorities. Each production start date of a production lot can have a different priority. The method sorts the production lots according to the associated priorities and the start dates. Then the method capacitates the production lots by iterating through the production lots to assign production capacity to the production lots in order of the associated priorities and the start dates.

Abstract: A method determines production starts in a manufacturing environment by inputting production starts. The method groups the production starts into production lots according to grouping rules and assigns start dates and associated priorities to each of the production lots based on business priorities. Each production start date of a production lot can have a different priority. The method sorts the production lots according to the associated priorities and the start dates. Then the method capacitates the production lots by iterating through the production lots to assign production capacity to the production lots in order of the associated priorities and the start dates.

Abstract: A method determines production starts in a manufacturing environment by inputting production starts. The method groups the production starts into production lots according to grouping rules and assigns start dates and associated priorities to each of the production lots based on business priorities. Each production start date of a production lot can have a different priority. The method sorts the production lots according to the associated priorities and the start dates. Then the method capacitates the production lots by iterating through the production lots to assign production capacity to the production lots in order of the associated priorities and the start dates.

Abstract: The methodology disclosed herein calculates the dates that product must come to stock for every component in the supply chain as needed to meet exit demands associated with a plurality of due dates and priorities. Every planned product stock is thus associated with multiple stock dates and associated priorities as is every planned manufacturing start and every shipment.

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: 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 method and system for resource rationing which employs decision rules for the optimal allocation of supply and capacity over time that satisfy two key requirements (a) being consistent with accepted operational objectives (e.g. low inventory, short lead times, prioritized allocation of supply and capacity) and (b) allowing for the timely computation of a feasible production schedule. The method and system is generally characterized in that it is able to divide each of the priority ranked scheduled releases (Material Requirements Planning (MRP)) into “N” separate and smaller sized scheduled releases where the priority of each of the “N” releases may be equal to the priority of the original release. The “N” separate and smaller sized scheduled releases are sorted according to priority and then used to determine an optimal supply schedule for allocating resources including component supply and assembly capacity.