A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)

DOI10.1007/978-3-540-68155-7_33zbMath1142.90405OpenAlexW1576802720MaRDI QIDQ5387644

Kong Wei Lye, Hoong Chuin Lau, Viet Bang Nguyen

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_33

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Proportionate progress: A notion of fairness in resource allocation
• Competitive Stability under Weak Gross Substitutability: The "Euclidean Distance" Approach
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Auction-based distributed scheduling in a dynamic job shop environment

This page was built for publication: A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)