Login | Register

Requirement-Based Bidding Language for Agent-Based Scheduling


Requirement-Based Bidding Language for Agent-Based Scheduling

Wang, Chun (2013) Requirement-Based Bidding Language for Agent-Based Scheduling. IEEE Transactions on Automation Science and Engineering, 10 (1). pp. 219-223. ISSN 1545-5955

[thumbnail of wang2013.pdf]
Text (application/pdf)
wang2013.pdf - Accepted Version

Official URL: http://dx.doi.org/10.1109/TASE.2012.2196795


This paper presents a requirement-based bidding language for agent-based scheduling. The language allows agents to attach their valuations directly to scheduling performance requirements. Compared with general bidding languages, the proposed one reduces agents’ valuation and system’s communication complexities. In addition, it results in efficient winner determination problem models. Experimental results show that the requirement-based language exhibits superior winner determination performance in terms of problem-solving speed and scalability.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Concordia Institute for Information Systems Engineering
Item Type:Article
Authors:Wang, Chun
Journal or Publication:IEEE Transactions on Automation Science and Engineering
Digital Object Identifier (DOI):10.1109/TASE.2012.2196795
Keywords:Agent-based scheduling , bidding language , economic-based negotiation mechanisms
ID Code:976813
Deposited By: Danielle Dennie
Deposited On:28 Jan 2013 17:02
Last Modified:18 Jan 2018 17:43


[1] E. Kutanoglu and S. D. Wu, "On combinatorial auction and Lagrangean relaxation for distributed resource scheduling," IIE Transactions, vol. 31, pp. 813-826, 1999.
[2] M. P. Wellman, W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason, "Auction protocols for decentralized scheduling," Games and Economic Behavior, vol. 35, pp. 271-303, 2001.
[3] J. Collins and M. Gini, "Scheduling tasks using combinatorial auctions: The magnet approach," Business Computing, vol. 3, p. 263, 2009.
[4] J. Kalagnanam and D. C. Parkes, "Auctions, Bidding and Exchange Design," in Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, D. Simchi-Levi, S. D. Wu, and M. Z. Shen, Eds.: Kluwer Academic Publishers, 2004.
[5] N. Nisan, "Bidding languages for combinatorial auctions " in Combinatorial Auctions, Cramton, Shoham, and Steinberg, Eds.: MIT Press, 2006.
[6] C. Boutilier and H. H. Hoos, "Bidding languages for combinatorial auctions," in Proc. 17th International Joint Conference on Artificial Intelligence, Seattle, Washington, 2001, pp. 1211–1217.
[7] T. Sandholm, "Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions," AI Magazine, vol. 28, pp. 45-58, 2007.
[8] T. S. Chandrashekar, Y. Narahari, C. H. Rosa, D. M. Kulkarni, J. D. Tew, and P. Dayama, "Auction-Based Mechanisms for Electronic Procurement," Automation Science and Engineering, IEEE Transactions on, vol. 4, pp. 297-321, 2007.
[9] L. Hoong Chuin, Z. J. Zhao, G. Shuzhi Sam, and L. Tong Heng, "Allocating Resources in Multiagent Flowshops With Adaptive Auctions," Automation Science and Engineering, IEEE Transactions on, vol. 8, pp. 732-743, 2011.
[10] W. Shen, "Distributed manufacturing scheduling using intelligent agents," IEEE intelligent systems, pp. 88-94, 2002.
[11] M. Pinedo, Scheduling: Theory, Algorithms, and Systems: Prentice Hall, 2002.
[12] S. F. Smith and M. A. Becker, "An ontology for constructing scheduling systems," in Working Notes of 1997 AAAI Symposium on Ontological Engineering, Stanford, CA, 1997.
[13] P. Mauguière, J. Billaut, and J. Bouquard, "New Single Machine and Job-Shop Scheduling Problems with Availability Constraints," Journal of Scheduling vol. 8, pp. 211-231, 2005.
[14] S. de Vries and R. V. Vohra, "Combinatorial auctions: a survey," INFORMS Journal on Computing, vol. 15, pp. 284-309, 2003.
[15] J. M. Keil, "On the complexity of scheduling tasks with discrete starting times " Operations Research Letters, vol. 12, pp. 293-295, 1992.
[16] N. Sadeh and M. S. Fox, "Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem," Artificial Intelligence, vol. 86, pp. 1-41, 1996.
[17] C. Boutilier, "Solving concisely expressed combinatorial auction problems," in the Proceedings of Eighteenth National Conference on Artificial Intelligence (AAAI-02) Edmonton, Alberta, Canada, 2002, pp. 359-366.
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top