Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2002-03-15
2008-11-11
An, Meng-Ai (Department: 2194)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S100000, C718S102000, C709S226000, C705S007380, C705S002000
Reexamination Certificate
active
07451449
ABSTRACT:
A work allocation system has a plurality of agents that bid for work in accordance with preferences and behavior of corresponding resources. Each agent represents a group of resources and is arranged to evaluate the likelihood that at least one resource in the group can carry out a work item. The evaluation is dependent on work items previously selected and/or carried out by the resource, so that the agent effectively models the preferences of its workers. The agent can use this preference information to decide a bidding strategy (i.e. to decide which work items it can bid for), and, having successfully bid for a work item, can allocate work based on individual characteristics and observed work preferences. The bidding for work between agents is, for example, conducted in accordance with contract net based negotiation.
REFERENCES:
patent: 5093794 (1992-03-01), Howie et al.
patent: 5111391 (1992-05-01), Fields et al.
patent: 5353229 (1994-10-01), Tanaka
patent: 5394324 (1995-02-01), Clearwater
patent: 5467268 (1995-11-01), Sisley et al.
patent: 5504837 (1996-04-01), Griffeth et al.
patent: 5586219 (1996-12-01), Yufik
patent: 5596502 (1997-01-01), Koski et al.
patent: 5638494 (1997-06-01), Pinard et al.
patent: 5732078 (1998-03-01), Arango
patent: 5802396 (1998-09-01), Gray
patent: 5826040 (1998-10-01), Fargher et al.
patent: 5826239 (1998-10-01), Du et al.
patent: 5832483 (1998-11-01), Barker
patent: 5870545 (1999-02-01), Davis et al.
patent: 5937388 (1999-08-01), Davis et al.
patent: 5943652 (1999-08-01), Sisley et al.
patent: 5953229 (1999-09-01), Clark et al.
patent: 5963911 (1999-10-01), Walker et al.
patent: 6014673 (2000-01-01), Davis et al.
patent: 6041306 (2000-03-01), Du et al.
patent: 6052684 (2000-04-01), Du
patent: 6078982 (2000-06-01), Du et al.
patent: 6226273 (2001-05-01), Busuioc et al.
patent: 6263358 (2001-07-01), Lee et al.
patent: 6321207 (2001-11-01), Ye
patent: 6374227 (2002-04-01), Ye
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 7065493 (2006-06-01), Homsi
patent: 2002/0004827 (2002-01-01), Ciscon et al.
patent: 2002/0029213 (2002-03-01), Borissov et al.
patent: 2003/0083926 (2003-05-01), Semret et al.
patent: 2004/0010592 (2004-01-01), Carver et al.
patent: 1 226 497 (2005-07-01), None
patent: 2194086 (1988-02-01), None
patent: 2322037 (1998-08-01), None
patent: WO 95/15635 (1995-06-01), None
patent: WO 96 03692 (1996-02-01), None
patent: WO 98/22897 (1998-05-01), None
patent: WO 99/11003 (1999-03-01), None
patent: WO 99/17194 (1999-04-01), None
patent: WO 01/29663 (2001-04-01), None
European Search Report dated Aug. 29, 2001.
International Search Report dated Jan. 16, 2006.
Brandolese et al., “A Multi-Agent Approach for the Capacity Allocation Problem”, International Journal of Production Economics, Jul. 20, 2000, Elsevier, Netherlands, vol. 66, No. 3, pp. 269-285, XP002226014.
Tharumarajah et al., “Approaches and Issues in Scheduling a Distributed Shop-Floor Environment”, Computers in Industry, Elsevier Science Publishers, Amsterdam, NL., vol. 34, No. 1, Oct. 1, 1997, pp. 95-109, XP004097814.
Chavez et al., “Challenger: A Multi-Agent System for Distributed Resource Allocation”, Proceedings of the First International Conference on Autonomous Agents Marina Del Rey, CA., Feb. 5-8, 1997, Proceedings of the International Conference on Autonomous Agents, New York, ACM, US, vol. CONF. 1, Feb. 5, 1997, pp. 323-332, XP002092534.
Genesereth, “Software Agents”, Communications of the ACM, vol. 37, No. 7, Jul. 1, 1994, pp. 48-53, XP002176092.
Oliveira et al., “Multi-agent Systems: Which Research for Which Applications”, Robotics and Autonomous Systems, Elsevier Science Publishers, Amsterdam, NL, vol. 27, No. 1-2, Apr. 30, 1999, pp. 91-106, XP004164321.
Nandy et al., “A Connectionless Approach to Providing QoS in IP Networks”, Computing Technology Lab, Norel, XP002137755.
O'Neill et al., “An Overview of Internet Protocols”, BT Technology, vol. 16, No. 1, Jan. 1998, XP-000736934.
Ramos, “A Holonic Approach for Task Scheduling in Manufacturing Systems”, IEEE International Conference on Robotics and Automation, vol. 3, Apr. 22-28, 1996, pp. 2511-2516.
Goscinski et al., “Resource Management in Large Distributed Systems”, Operating Systems Review (SIGOPS), vol. 24, No. 4, Oct. 1, 1990, pp. 7-25.
Lin et al., “An Agent-Based Flexible Routing Manufacturing Control Simulation System”, Proceedings of the 1994 Winter Simulation Conference, pp. 970-977.
Sandholm, Limitations of the Vickrey Auction in Computational Multiagent Systems, Proceedings of ICMAS '96, 2ndInternational Conference on Multiagent Systems, Kyoto, Japan, Dec. 10-13, 1996, pp. 299-306, XP002092535.
Nwana et al., An Introduction to Agent Technology, BT Technology Journal, vol. 14, No. 4, Oct. 1996, pp. 55-67, XP000635333.
International Search Report (PCT/GB/98 02944) dated Feb. 18, 1999.
Parrott et al., “Comparing the WMS Real Time Algorithm With AIP Predictive Schedulers”, BT Technology Journal, vol. 13, No. 1, Jan. 1, 1995, pp. 110-120.
Mohan, “Recent Trends in Workflow Management Products, Standards and Research”, IBM Almaden Research Center white paper, 1997.
Georgakopoulos et al., “An Overview of Workflow Management” from process modeling to workflow automation infrastructure, Distributed and Parallel Databases, 1995.
“HP Process Manager Process Design Guide”, HP Process Manager, 1998.
Bender et al., “Practical Modeling for Resource Management”, Harvard Business Review, Mar./Apr. 1981.
Shan et al., “HP Workflow Research” past, present, future, North Atlantic Treaty Organization—Advanced Study Institute Workshop, 1997.
Wallace, “Practical Applications of Constraint Programming”, Constraints: An International Journal, 1996.
Tsang et al., “Constraint Satisfaction in Discrete Optimization”, Unicom Seminar, Mar. 1998.
Tarumi et al., “WorkWeb System—Multi-Workflow Management with a Multi-Agent System”, ACM Siggroup, 1997.
Shan, “Business Process Flow Management and its Application in the Telecommunications Management Network—HP's OpenPM Middleware Technology”, Hewlett-Packard Journal, Oct. 1996.
Ezpeleta et al., “A Petri Net Based Deadlock Prevention Policy for Flexible Manufacturing Systems”, IEEE, 1995.
Raman et al., “Matchmaking: An Extensible Framework For Distributed Resource Management”, Baltzer Science Publishers, Cluster Computing, 1999.
Reveliotis et al., “Polynomial-Complexity Deadlock Avoidance Policies for Sequential Resource Allocation Systems”, IEEE, 1997.
Smith, “The Contract New Protocol: High-Level Communication and Control in a Distributed Problem Solver”, Transactions on Computers, vol. C-29, No. 12, pp. 1104-1113, Dec. 1980.
Alternative Protocols to “Contract Net”, FIPA web site.
Collis et al, “The Zeus Agent Building Toolkit”, Technology Journal 16(3) Jul. 1998, pp. 60-80.
Ndumu et al., “Towards Desktop Personal Travel Agents”, BT Technology Journal, vol. 16, No. 3, Jul. 1998.
Shannon, “A Mathematical Theory of Communication”, The Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, Jul., Oct. 1948.
Quinlan, “Induction of Decision Trees”, Machine Learning 1:81-106, 1986.
Smyth, “An Information Theoretic Approach To Rule Induction from Database”, IEEE,1992.
Kononenko, “On Biases In Estimating Multi-Valued Attributes”, Proceedings of the International Joint Conference on Artificial Intelligence, 1995 (IJCAI '95), pp. 1034-1040.
Sim et al., “Simulation of a Multi-agent Protocol for Task Allocation in Cooperative Design”, 1999, IEEE.
Shen et al., A Hybrid Agent-Oriented Infrastructure for Modeling Manufacturing Enterprises, Proceedings of KAW '98.
Kearney Paul J
Stark Thomas J
Thompson Simon G
An Meng-Ai
British Telecommunications plc
Nixon & Vanderhye PC
Wu Qing-Yuan
LandOfFree
Work allocation 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 Work allocation system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Work allocation system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4041591