International Business Machines Corporation

Chi-Tai Wang

Robert J Milne

Brian Trevor Denton

Robert A Orzell

Sanjay R Hegde

Shivakumar P Patil

Stuart H Smith

Jacqueline N Ward

Chih-Hui Chang

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.

Planning production for complementary demands

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., customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the enterprise.

Method for fair sharing limited resources between multiple customers

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.

Large scale supply planning

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.

Method for identifying product assets in a supply chain used to satisfy multiple customer demands

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.

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., customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the enterprise.

Growing community of inventors

CA

Chi-Tai Wang