Boots – shoes – and leggings
Patent
1989-12-04
1996-06-04
Hayes, Gail O.
Boots, shoes, and leggings
G06F 1520
Patent
active
055240771
ABSTRACT:
This invention provides a method and system for cost-based resource scheduling. This invention develops an initial resource schedule. This schedule is then represented as a Schedule Precedence Graph, which is an acyclic directed graph consisting of nodes and arcs. Each node corresponds to a task to be performed, and each arc corresponds to a technological or assigned task precedence. Each node is assigned a cost, which corresponds to cost or savings due to delaying the task one time unit. In this invention, the Maximum Flow Procedure is iteratively invoked to determine which tasks can be profitably delayed.
REFERENCES:
patent: 3703725 (1972-11-01), Gomersall et al.
Operations Research, V. 35, No. 3, May-Jun., 1987, Scheduling Tasks in a Fabrication/Assembly Process, Bruce Faaland et al, pp. 378-388.
Working Paper 83-01, Univ. of Wash, DJ-10, Seattle Wa. 98195, Smithfield D: Case and Computer Instructions, W. L. Berry & T. G. Schmitt.
Naval Res. Logist. Quart., 15, Multiple Factor Rules for Sequencing with Assembly Constraints, Maxwell, W.L. & Mehra, M., pp. 251-254.
Operations Research, An Introduction, Handy A. Taha, 3rd Edition, 1982.
Adam, N., and J. Surkis, "A Comparison of Capacity Planning Techniques in a Job Shop Control System," Management Science 23:1011-1015, 1977.
Aho, A. H., J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.
Anderson, J. C., R. G. Schroeder, S. E. Tupy and White, "A Survey of MRP Implementation and Practice," Production and Inventory Management 23:51-66, 1982.
Baker, K. R., Introduction to Sequencing and Scheduling, 178-231, 1974.
Baker, K. R., "Sequencing Rules and Due Date Assignments in a Job Shop," Management Science 30:1093-1104, 1984.
Balinski, M. L., "On a Selection Problem," Management Science 17:230-231, 1970.
Browne, J., K. Rathmill and K. E. Stecke, "Classification of Flexible Manufacturing Systems," The FMS Magazine, 114-117, Apr. 1984.
Chvatal, V., Linear Programming 367-387, W. H. Freeman, New York, 1980.
Dinic, E. A., "Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation," Soviet Mathematics Doklady 11:1277-1280, 1970.
Edmonds, J., and R. M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems," JACM 19:248-264, Apr. 1972.
Eisner, M. J., and D. G. Severance, "Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases," JACM 23:619-635, 1976.
Elvers, D. A., "Job Shop Dispatching Rules Using Various Delivery Date Setting Criteria," Production and Inventory Management, 62-70, 4th Qtr. 1973.
Florian, M., P. Trepant and G. McMahon, "An Implicit Enumeration Algorithm for the Machine Sequencing Problem," Management Science 17:B782-B792, 1971.
Fong, C. O., and M. R. Rao, "Accelerated Labelling Algorithms for the Maximum Flow Problem with Applications to Transportation and Assignment Problems," Working Paper 7222, Graduate School of Management, University of Rochester, 1974.
Ford, L. R., and D. R. Fulkerson, "Maximal Flow Through a Network," Canadian Journal of Mathematics 8:399-404, 1956.
Ford, L. R., and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.
Fulkerson, L. R., and G. B. Dantzig, "Computation of Maximal Flows in Networks," Naval Research Logistics Quarterly 2:277-283, 1955.
Galil, Z., "An OV(V5/3E2/3) Algorithm for the Maximal Flow Problem," Acta Informatica 14:221-242, 1980.
Galil, Z., and A. Naamad, "An O(EV Log 2V) Algorithm for the Maximal Flow Problem," Journal of Computer and System Sciences 21:203-217, 1980.
Glover, F., and D. Klingman, J. Mote, and D. Whitman, "Comprehensive Computer Evaluation and Enhancement of Maximum Flow Algorithms," Applications of Management Science 3:109-175, 1983.
Glover F., D. Klingman, J. Mote, and D. Whitman, "A Primal Simplex Variant for the Maximum Flow Problem," Naval Research Logistics Quarterly 31:41-61, 1984.
Goldberg, A. V., and R. E. Tarjan, "A New Approach to the Maximum Flow Problem," Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 136-146, 1986.
Greenberg, H. H., "A Branch-Bound Solution to the General Scheduling Problem," Operations Research 16:353-316, 1968.
Gusfield, D., C. Martel and D. Fernandez-Baca, "Fast Algorithms for Bipartite Network Flow," Working Paper YALEU/DCS/TR-356, Department of Computer Science, Yale University, 1985 (to appear in SIAM Journal on Computing).
IBM, Program Product: Capacity Planning --Infinite Loading/Capacity Planning--Finite Loading Application Description, GH20-0627-2, 1970.
Kanet, J. J., and T. C. Hayya, "Priority Dispatching with Operation Due *Dates in a Job Shop," Journal of Operations Management 2:167-176, 1982.
Karzanov, A. V., "Determining the Maximum Flow in a Network by the Method of Preflows," Soviet Mathematics Doklady 15:434-437, 1974.
Kim, K., "On the Maximal Closure Problem" Ph.D. Thesis, University of Washington, Seattle, Washington, 1986.
Lerchs, H., and I. F. Grossman, "Optimum Design of Open-Pit Mines," Canadian Mining and Metallurgical Bulletin 58:47-54, 1965.
Malhorta, V. M., M. P. Kumar and S. N. Maheshwari, "An O([V]3) Algorithm for Finding Flows in Networks," Information Processing Letters 7:277-278, 1978.
Mamer, J. W., and S. A. Smith, "Optimizing Field Repair Kits Based on Job Completion Rate," Management Science 28:1328-1333, 1982.
Manne, A. S., "On the Job-Shop Scheduling Problem," Operations Research 8:219-233, 1960.
Maxwell, W. L., and M. Mehra, "Multiple Factor Rules for Sequencing with Assembly Constraints," Naval Research Logistics Quarterly 15:241-254, 1968.
Nijenhuis, A., and H. S. Wilf, Combinatorial Algorithms for Computers and Calculators, 2d ed., Academic Press, New York, 1978.
Orlicky, J., Material Requirements Planning, McGraw-Hill, New York, 1972.
Phillips, S., Jr., and M. I. Dessouky, "Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Comcept," Management Science 24:393-400, 1977.
Picard, J. C., "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science 22:1268-1272, 1976.
Plossl, G. W., and O. W. Wight, "Capacity Planning and Control," Production and Inventory Management 14:31-67, 3d Qtr. 1973.
Reiter, S., "A System for Managing Job-Shop Production," Journal of Business 39:371-393, 1966.
Rhys, J. M. W., "A Selection Problem of Shared Fixed Costs and Network Flows," Management Science 17:200-207, 1970.
Russel, R. A., "A Comparison of Heuristics for Scheduling Projects with Cash Flows and Resource Restrictions," Management Science 32:1291-1300, 1986.
Russel, R. S., and B. W. Taylor, "An Evaluation of Sequencing Rules for an Assembly Shop," Decision Sciences 16:196-212, 1985.
Stecke, K. E., and J. Browne, "Variations in Flexible Manufacturing Systems According to the Relevant Types of Automated Materials Handling," Material Flow, vol. 2, 1985.
Tarjan, R. E., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1983.
Tarjan, R. E., "A Simple Version of Karzanov's Blocking Flow Algorithm," Operations Research Letters 2:265-268, 1984.
Sculli, D., "Priority Dispatching Rules in Job Shops with Assembly Operations and Random Delays," Omega 8:227-234, 1980.
Sidney, J. B., "Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research 25:62-69, 1977.
Smith-Daniels, D. E., and N. J. Aquilano, "Constrained Resource Project Scheduling Subject to Material Constraints," Journal of Operations Management 4:369-387, 1984.
Thompson, K., "MRP II in the Repetitive Manufacturing Environment," Production and Inventory Management, 4th Qtr, 1983.
Trevelen, M. D., and D. A. Elvers, "An Investigation of Labor Assignment Rules in a Dual Constrained Job Shop," Journal of Operations Management 6:51-67, 1985.
Tucker, A., "A Note on Convergence of the Ford-Fulkerson Flow Algorithm," Mathematics of Operations Research 2:143-144, 1977.
Weingartner, H. M., "Capital Budgeting of Interrelated Projects: Survey and Synthesis," Management Science 12:485-516, 1966.
Wiest, J. D., "A Heuris
Faaland Bruce H.
Schmitt Thomas G.
Hayes Gail O.
Kyle Charles R.
LandOfFree
Scheduling method and system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scheduling method and system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling method and system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-390415