Computationally Manageable Combinational Auctions
Management Science
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
An auction-based method for decentralized train scheduling
Proceedings of the fifth international conference on Autonomous agents
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Manufacturing Scheduling Using Intelligent Agents
IEEE Intelligent Systems
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Roadmap to Auction-Based Negotiation Protocols for Electronic Commerce
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Scheduling tasks with precedence constraints to solicit desirable bid combinations
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Bidding languages for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A Complete Multiagent Framework for Robust and Adaptable Dynamic Job Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Distributed Scheduling for Reactive Maintenance of Complex Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Internet scheduling environment with market-driven agents
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scheduling web banner advertisements with multiple display frequencies
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Agent-based modeling of supply chains for distributed scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Wireless channel allocation using an auction algorithm
IEEE Journal on Selected Areas in Communications
Service customization under capacity constraints: an auction-based model
Journal of Intelligent Manufacturing
AdSCHE: DESIGN OF AN AUCTION-BASED FRAMEWORK FOR DECENTRALIZED SCHEDULING
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
This paper presents a formulation and an algorithm for the winner determination problem in auction-based scheduling. Without imposing a time line discretization, the proposed approach allows bidders to bid for the processing of a set of jobs using a requirement-based bidding language, which naturally represents scheduling constraints. The proposed winner determination algorithm uses a depth first branch and bound search. The search branches on bids, and a constraint-directed scheduling procedure is used at each node to verify the feasibility of the temporary schedule. Experiments show that the proposed algorithm is on average more than an order of magnitude faster than a commercial optimization package, CPLEX 10.0.