Method for considering hierarchical preemptive demand...

Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Health care management

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07966214

ABSTRACT:
The invention comprises a method for achieving consideration of preemptive priorities within a supply chain optimization model. More specifically, the invention provides a method of allocating resources to a hierarchy of demand priorities in a linear programming production planning system. In particular, the invention aggregates the demand priorities into different priority groups and allocates the resources to the highest priority group of demand priorities using a first linear programming model. Next, the invention allocates remaining resources to the next highest priority group of demand priorities using a second linear programming model. The second linear programming model uses results from the first linear programming model. The invention continues this process by iteratively repeating the process of allocating remaining resources to the remaining groups of demand priorities, in order of priority. The system and method were employed to integrate the consideration of preemptive prioritization of customer demands 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.

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: 6041267 (2000-03-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
de Farias, D. “The Linear Programming Approach Toapproximate 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. “The Linear Programming Approach Toapproximate 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., Van Roy, B. “The Linear Programming Approach to Approximate Dynamic Programming”. Operations Research, vol. 51, No. 6, Nov.-Dec. 2003, pp. 850-865.
de Farias, D. “The Linear Programming Approach Toapproximate 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., Van Roy, B. “The Linear Programming Approach to Approximate Dynamic Programming”. Operations Research, vol. 51, No. 6, Nov.-Dec. 2003, pp. 850-865.
Yi-Feng Hung and Robert C. Leachman, “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.
Nagen Nagarur, Prem Vratb, Wanchai Duongsuwarf “Production planning and scheduling for injection moulding of pipe fittings a case study”, Int. J. Production Economics 53 (1997) 157-170.
Peter Lyon, et al. “Matching Assets with Demand in Supply-Chain Management at IBM Microelectronics”, Interfaces 31: Jan.-Feb. 1, 2001 (pp. 108-124).
de Farias, D. “The Linear Programming Approach Toapproximate 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.
Yi-Feng Hung and Robert C. Leachman, “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.
Nagen Nagarur, Prem Vratb, Wanchai Duongsuwarf “Production planning and scheduling for injection moulding of pipe fittings a case study”, Int. J. Production Economics 53 (1997) 157-170.
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 Advances 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, Office Action Communication, Jan. 22, 2009, 13 pages.
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.
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.
Chu, S. “A Mathematical Programing Approach Towards Optimized Master Production Scheduling”, Int'l J. Of Production Economics, vol. 38, pp. 269-279.
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,974, 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,974, Office Action Communication, Mar. 4, 2010, 10 pages.
Denton et al., U.S. Appl. No. 12/125,193, Office Action Communication, Feb. 9, 2010, 24 pages.
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: Appli

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for considering hierarchical preemptive demand... 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 considering hierarchical preemptive demand..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for considering hierarchical preemptive demand... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2730381

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.