A market-based multi-agent system model for decentralized multi-project scheduling

Annals of Operations Research

Volumn 150, Issue 1, 2007, Pages 115-135

  Confessore, Giuseppe ^a   Giordani, Stefano ^b   Rismondo, Silvia ^a  

^a CNR   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Combinatorial auction; Heuristic algorithms; Multi agent system; Multi project scheduling

Indexed keywords

EID: 33846864716     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0158-9     Document Type: Article

References (18)

1. Agnetis, A., P.B. Mirchandani, D. Pacciarelli, and A. Pacifici. (2004). "Scheduling Problems with Two Competing Agents." Operations Research, 52(2), 229-242.
2. Arbib, C. and F. Rossi. (2000). "Optimal Resource Assignment Through Negotiation in a Multi-agent Manufacturing System." IIE Transactions, 32, 963-974.
3. Brucker, P., A. Drexl, R. Moehring, K. Neumann, and E. Pesch. (1999). "Resource-Constrained Project Scheduling: Notation, Classification. Models and Methods." European Journal of Operational Research, 112, 3-41.
4. Jennings, N.R. and M. Wooldridge. (1995). "Applying Agent Technology." Applied Artificial Intelligence, 9, 357-369.
5. Klemperer, P. (1999). "Auction Theory: A Guide to the Literature." Journal of Economic Surveys, 13, 227-286.
6. Knotts, G., M. Dror, and B.C. Hartman. (2000). "Agent-Based Project Scheduling." IIE Transactions, 32, 387-401.
7. Kolisch, R. (1996). "Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation." European Journal of Operational Research, 90, 320-333.
8. Kolisch R. and A. Sprecher. (1996). "PSPLIB-A Project Scheduling Library." European Journal of Operational Research, 96, 205-216.
9. Kubiak, W., J. Błazewicz, P. Formanowicz, J. Breit, and G. Schmidt. (2002). 'Two-Machine Flow Shops with Limited Machine Availability." European Journal of Operational Research, 136, 528-540.
10. Lova, A. and P. Tormos. (2001). "Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling." Annals of Operations Research 102, 263-286.
11. Lee, Y.-H., S.R. Kumara, and K. Chatterjee. (2003). "Multiagent Based Dynamic Resource Scheduling for Distributed Multiple Projects Using a Market Mechanism." Journal of Intelligent Manufacturing, 14, 471-484.
12. McAfee, R.P. and J. McMillan. (1987). "Auctions and Bidding." Journal of Economic Literature, 25, 699-738.
13. Parkes, D.C. (1999). "iBundle:An Efficient Ascending Price Bundle Auction."InProc. of first ACM Conference on Electronic Commerce, pp. 148-157.
14. Rothkopf, M.H., A. Pereč, and R.M. Harstad. (1998). "Computationally Manageable Combinatorial Auctions." Management Science, 44, 1131-1147.
15. Sandholm, T. (2000). "Approaches to Winner Determination in Combinatorial Auctions." Elsevier Decision Support System, 28, 165-176.
16. Sandholm, T. and S. Suri. (2000). "Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations." In Five, of National Conference on Artificial Intelligence, pp. 90-97.
17. Sandholm, T., S. Suri, A. Gilpin, and D. Levine. (2002). "Winner Determination in Combinatorial Auction Generalizations." In Proc. of the First International Conference on Autonomous Agents and Multi-Agent Systems.
18. Wellman, M.P., W.E. Walsh, P.R. Wurman, and J.K. MacKie-Mason. (2001). "Auction Protocols for Decentralized Scheduling." Games and Economic Behavior, 35, 271-303.