Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating
Reexamination Certificate
2011-05-03
2011-05-03
Jean, Frantz B (Department: 2454)
Electrical computers and digital processing systems: multicomput
Computer network managing
Network resource allocating
Reexamination Certificate
active
07937475
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., customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the enterprise.
REFERENCES:
patent: 5093794 (1992-03-01), Howie et al.
patent: 5233533 (1993-08-01), Edstrom et al.
patent: 5943484 (1999-08-01), Milne et al.
patent: 5971585 (1999-10-01), Dangat et al.
patent: 6088626 (2000-07-01), Lilly et al.
patent: 6151582 (2000-11-01), Huang et al.
patent: 6498786 (2002-12-01), Kirkby et al.
patent: 6701201 (2004-03-01), Hegde et al.
patent: 6898472 (2005-05-01), Crampton et al.
patent: 7164959 (2007-01-01), Huang et al.
patent: 7197469 (2007-03-01), Hegde et al.
patent: 7464147 (2008-12-01), Fakhouri et al.
patent: 2002/0133387 (2002-09-01), Wilson et al.
patent: 2002/0188499 (2002-12-01), Jenkins et al.
patent: 2002/0198757 (2002-12-01), Hegde et al.
patent: 2003/0065415 (2003-04-01), Hegde et al.
patent: 2003/0149631 (2003-08-01), Crampton et al.
patent: 2003/0208392 (2003-11-01), Shekar et al.
patent: 2004/0030428 (2004-02-01), Crampton et al.
patent: 2005/0144056 (2005-06-01), Wang et al.
patent: 0 425 405 (1991-05-01), None
patent: 0425405 (1991-05-01), None
Moodie, D., “Demand Management: The Evaluation of Price and Due Date Negotiation Strategies Using Simulation,” Production and Operations Management, vol. 8, No. 2, Summer 1999, pp. 151-162.
Wang et al., “Earliness/Tardiness Production Planning Approaches with Due-Window for Manufacturing Systems.” Computers in Industrial Engineering, 34:4 (1998), pp. 825-836.
Fang et al. “A Rolling Horizon Job Shop Rescheduling Strategy in the Dynamic Environment.” International Journal of Advanced Manufacturing Technology, 13 (1997), pp. 227-232.
Potts et al., “Single Machine Scheduling to Minimize Total Late Work.” Operations Research, 40:3 (1992), pp. 586-595.
Wang et al., “JIT Production Planning Approach with Fuzzy Due Date for OKP Manufacturing systems.” International Journal of Production Economics, 58 (1999), pp. 209-215.
Denton et al. U.S. Appl. No. 10/707,974, BUR920040009US1, Office Action Communication, Jan. 22, 2009, 13 pages.
Denton et al., U.S. Appl. No. 10/707,974, BUR920040009US1, Office Action Communication, Jul. 20, 2009, 9 pages.
Kern et al., “Master Production Rescheduling Policy in Capacity-Constrained Just-In-Time Make-To-Stock Environments”, Decision Sciences, Spring 1996, vol. 27, Issue 2, ABI/INFORM Global, p. 365-387.
Denton et al., U.S. Appl. No. 10/707,977, Office Action Communication, Nov. 18, 2009, 17 pages.
Denton et al., U.S. Appl. No. 10/707,979, Office Action Communication, Jan. 8, 2010, 21 pages.
de Farias, D., “The Linear Programming Approach to Approximate Dynamic Programming: Theory and Application,” Dissertation, Stanford University, Jun. 2002.
Leachman, R., et al., “IMPReSS: An Automated Production-Planning fi and Delivery-Quotation System at Harris Corporation—Semiconductor Sector,” Interfaces vol. 26, No. 1, 1996.
de Farias, D., et al., “The Linear Programming Approach to Approximate Dynamic Programming,” Operations Research, vol. 51, No. 6, Nov.-Dec. 2003, pp. 850-865.
Leachman et al., “Impress: An Automated Production Planning and Delivery-Quotation System at Harris Corporation Semiconductor Sector”, Interfaces vol. 26:1, p. 6-37, 1996.
Nemhauser et al., “Integer and Combinatorial Optimization”, Chapter 2—Linear Programming, p. 27-41, 1999.
G. Dantizig, “Linear Programmings and Extensions”, Princeton University Press, p. 448-455, 1963.
Denton et al., U.S. Appl. No. 10/070,979, Office Action Communication, Aug. 4, 2009, 26 Pages.
de Farias, D., “The Linear Programming Approach To Approximate Dynamic Programming: Theory and Applicaiton,” Jun. 2002, 44 pages.
Leachman, et al., “IMPReSS: An Automated Production-Planning and Delivery-Quotation System at Harris Corporation-Semiconductor Sector,” Interfaces 26: Jan. 1-Feb. 1996, pp. 6-37.
Denton et al., U.S. Appl. No. 12/434,733, Notice of Allowance, Apr. 12, 2010, 9 pages.
Chen et al., “Quantity and Due Date Quoting Available to Promise,” Information Systems Frontiers, vol. 3, Issue 4, pp. 477-488, 2001.
Wang et al., “Soft Computing for Multicustomer Due-Date Bargaining,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 26, No. 4, Nov. 1999.
Hegedus et al., “Due Date Setting with Supply Constraints in Systems Using MRP,” Computers & Industrial Engineering 39, pp. 293-305, 2001.
Denton et al., U.S. Appl. No. 10/707,979, Office Action, May 13, 2010, 21 pages.
Hung, et al., “A Production Planning Methodology for Semiconductor Manufacturing Based on Iterative Simulation and Linear Programming Calculations,” IEEE Transactions on Semiconductor Manufacturing, vol. 9, No. 2, May 1996, pp. 257-269.
Lyon, et al., “Matching Assets with Demand in Supply-Chain Management at IBM Microelectronics,” Interfaces 31: Jan. 1-Feb. 2001 (pp. 108-124).
Nagarur, et al., “Production Planning and Scheduling for Injection Moulding of Pipe Fittings,” A Case Study, Int. J. Production Economics 53, 1997, pp. 157-170.
Denton et al., U.S. Appl. No. 10/707,974, Office Action Communication, Mar. 4, 2010, 10 pages.
Denton et al., U.S. Appl. No. 10/707,974, Office Action Communication, Sep. 15, 2010, 10 pages.
Denton et al., U.S. Appl. No. 10/707,977, Office Action Communication, Mar. 18, 2009, 10 Pages.
Karabuk, et al. “Coordinating Strategic Capacity Planning in the Semiconductor Industry”. Operations Research, vol. 51, No. 6, Nov.-Dec. 2003, pp. 839-849.
Chen, H. et al., “A Lagrangian Relaxation Approach for Supply Chain Planning with Order/Setup Costs and Capacity Constraints”. Journal of Systems Science and Systems Engineering, vol. 12, No. 1, pp. 98-110, Mar. 2003.
Eksioglu, S. “Optimizing Integrated Production, Inventory and Distribution Problems in Supply Chains”. A Dissertation, University of Florida, 2002.
George B. Dantzig, G.B., et al. “Decomposition Principle for Linear Programs”, Operations Research, vol. 8, No. 1 (Jan.-Feb. 1960), pp. 101-111.
Denton et al., U.S. Appl. No. 10/707,979, Office Action Communication, Oct. 12, 2010, 17 pages.
de Farias, D., “The Linear Programming Approach to Approximate Dynamic Programming: Theory and Application,” Dissertation, Stanford University, Jun. 2002.
Leachman, et al., “IMPReSS: An Automated Production-Planning and Delivery-Quotation System at Harris Corporation-Semiconductor Sector,” Interfaces vol. 26, No. 1, 1996.
de Farias, D., et al., “The Linear Programming Approach to Approximate Dynamic Programming,” Operations Research, vol. 51, No. 6, Nov.-Dec. 2003, pp. 850-865.
Yi- Feng Hung, “A Production Planning Methodology for Semiconductor Manufacturing Based on Iterative Simutaltin and Linear Programming Calculations,” IEEE transactions on Semiconductor Manufacturing, vol.
Denton Brian T.
Milne Robert J.
Wang Chi-Tai
Gibb I.P. Law Firm LLC
International Business Machines - Corporation
Jean Frantz B
Kotulak, Esq. Richard M.
LandOfFree
Method for fair sharing limited resources between multiple... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for fair sharing limited resources between multiple..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for fair sharing limited resources between multiple... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2663998